10789
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 25
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10790
- Proper Divisor Sum (Aliquot Sum)
- 1
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10788
- Möbius Function
- -1
- Radical
- 10789
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 161
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1314
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that the continued fraction for sqrt(k) has period 77.at n=10A020416
- Fibonacci sequence beginning 1, 28.at n=14A022398
- a(n) is the least integer that has exactly n anagrams that are primes.at n=19A046890
- a(n) is the least number with exactly n permutations of digits that are primes.at n=29A046893
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.at n=36A050036
- a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 4.at n=36A050052
- a(n) = a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = 3.at n=36A050068
- Primes p such that x^31 = 2 has no solution mod p.at n=36A059225
- Primes p such that p^9 reversed is also prime.at n=33A059702
- Primes whose digits can be arranged in increasing cyclic order - to form a substring of 123456789012345678901234567890...at n=25A068710
- Five-digit distinct-digit primes.at n=28A074671
- Smallest number formed by using all the digits (with multiplicity) of next n numbers.at n=3A080479
- Numbers in ascending order formed by using all the digits of the next n numbers.at n=9A081991
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A082355/A082356.at n=10A089427
- Leading diagonal of triangle A093922.at n=20A093923
- Primes arising in A073946.at n=10A113943
- a(n) = Floor[1/2((1-2/Sqrt[3])^n+(1-2/Sqrt[3])^n)].at n=13A116953
- Numbers n such that f(n), f(n+1) and f(n+2) are prime, f(m)=72*m^2+7.at n=15A121089
- Where records occur in A124522.at n=17A124743
- Primes p such that (p + nextprime + p) and also (p + previousprime + p) are primes.at n=26A125146