10552
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19800
- Proper Divisor Sum (Aliquot Sum)
- 9248
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5272
- Möbius Function
- 0
- Radical
- 2638
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- 148
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- a(n) = A027113(n, n+3).at n=10A027116
- a(n) = A027113(n, 2n-10).at n=8A027128
- a(n+1) = a(n)-th composite number, with a(1) = 11.at n=31A059407
- Indices of primes with digit product = 2.at n=4A107611
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and pyramid weight k.at n=47A129163
- Counts of Kekulean pericondensed planar benzenoid hydrocarbons (see reference for precise definition).at n=6A141787
- Numbers n such that gcd(n, phi(n)) = gcd(phi(n), sigma(n)) = gcd(sigma(n), n) = tau(n).at n=20A217301
- Nonprimes such that it takes exactly 3 iterations of reverse-and-add digits to generate a prime.at n=10A245208
- Indices of the start of 9 successive distinct digits in the decimal expansion of Pi.at n=36A258158
- Number of length-n binary words avoiding (5+sqrt(5))/2-powers.at n=15A308148
- Numbers k such that 345*2^k+1 is prime.at n=42A319742