10597
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 10598
- 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
- 10596
- Möbius Function
- -1
- Radical
- 10597
- 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
- 99
- 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
- 1292
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Primes that remain prime through 3 iterations of function f(x) = 9x + 10.at n=34A023299
- Numbers whose base-4 representation contains exactly four 1's and three 2's.at n=32A045108
- Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 17.at n=18A050966
- Five-digit distinct-digit primes.at n=19A074671
- 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=[4, 6,6]; short d-string notation of pattern = [466].at n=15A078852
- Sum of A037888(p) for all primes p such that 2^n < p < 2^(n+1).at n=14A095742
- Indices of primes in sequence defined by A(0) = 79, A(n) = 10*A(n-1) - 21 for n > 0.at n=23A101150
- Primes p that divide Fibonacci[(p+1)/7].at n=18A125252
- Primes of the form 2*3*5*7*k + 97.at n=27A141899
- Primes congruent to 26 mod 31.at n=41A142030
- Primes congruent to 15 mod 37.at n=41A142124
- Primes congruent to 19 mod 41.at n=33A142216
- Primes congruent to 19 mod 43.at n=35A142268
- Primes congruent to 22 mod 47.at n=28A142373
- Primes congruent to 13 mod 49.at n=33A142425
- Primes congruent to 40 mod 51.at n=39A142500
- Primes congruent to 50 mod 53.at n=25A142580
- Primes congruent to 37 mod 55.at n=32A142627
- Primes congruent to 52 mod 57.at n=37A142697
- Primes congruent to 36 mod 59.at n=22A142763