HP Prime Graphing Wireless Calculator - Manual (Page 134)

130 Functions and commands
GCD Returns the greatest common divisor of two or more integers.
gcd(Intgr1, Intgr2,…)
Example:
gcd(32,120,636)
returns
4
LCM Returns the least common multiple of two or more integers.
lcm(Intgr1, Intgr2,…)
Example:
lcm(6,4)
returns
12
Prime
Test if Prime Tests whether or not a given integer is a prime number.
isPrime(Integer)
Example:
isPrime(19999)
returns
false
Nth Prime Returns the nth prime number.
ithprime(Intg(n)) where n is between 1 and 200,000
Example:
ithprime(5)
returns
11
Next Prime Returns the next prime or pseudo-prime after an integer.
nextprime(Integer)
Example:
nextprime(11)
returns
13
Previous Prime Returns the prime or pseudo-prime number closest to but
smaller than an integer.
prevprime(Integer)
Example:
prevprime(11)
returns
7
Euler Compute’s Euler's totient for an integer.
euler(Integer)
Example:
euler(6)
returns
2