10847
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10848
- 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
- 10846
- Möbius Function
- -1
- Radical
- 10847
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 68
- 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
- 1318
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- First coordinate of fundamental unit of real quadratic field with discriminant A003658(n), n >= 2.at n=48A014000
- Graham-Sloane-type lower bound on the size of a ternary (n,3,10) constant-weight code.at n=3A030510
- Numbers whose set of base-15 digits is {2,3}.at n=28A032815
- Primes p from A031924 such that A052180(primepi(p)) = 19.at n=13A052235
- Write fundamental unit for real quadratic field of discriminant n as x + y*omega; sequence gives values of x for n == 1 mod 4.at n=30A053370
- a(n) is the least number k such that prime(k) - 1 is divisible by 2^(n-1) and the quotient is odd.at n=14A057776
- Five-digit distinct-digit primes.at n=30A074671
- Initial term in sequence of four consecutive primes separated by 3 consecutive differences each <=6 (i.e., when d=2,4 or 6) and forming d-pattern=[6, 6,2]; short d-string notation of pattern = [662].at n=12A078857
- Primes p such that the differences between the 5 consecutive primes starting with p are (6,6,2,6).at n=7A078965
- Triangle read by rows: T(n,k) is the number of peakless Motzkin paths of length n and height k (can be easily expressed using RNA secondary structure terminology).at n=59A098076
- Smallest prime p such that p^2 equal to the sum of 2n+1 consecutive odd primes, or 1 if such a prime does not exist.at n=48A122654
- Primes congruent to 6 mod 37.at n=33A142115
- Primes congruent to 23 mod 41.at n=34A142220
- Primes congruent to 11 mod 43.at n=35A142260
- Primes congruent to 37 mod 47.at n=27A142388
- Primes congruent to 18 mod 49.at n=28A142429
- Primes congruent to 35 mod 51.at n=42A142497
- Primes congruent to 35 mod 53.at n=23A142565
- Primes congruent to 12 mod 55.at n=32A142609
- Primes congruent to 17 mod 57.at n=36A142676