15573
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21600
- Proper Divisor Sum (Aliquot Sum)
- 6027
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9968
- Möbius Function
- -1
- Radical
- 15573
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 102
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Average of terms in n-th row of A077529.at n=36A077532
- Number of partitions of n such that if the smallest part is k, then both k and k+1 occur exactly once.at n=54A118267
- a(n) is the sum of the smallest parts of all partitions of n that do not contain 1 as a part.at n=39A182708
- Number of nXnXn 0..6 triangular arrays with each element x equal to the number its neighbors equal to 5,1,1,1,4,0,3 for x=0,1,2,3,4,5,6.at n=4A197651
- a(n) = Sum_{d|n} phi(d^d), where phi(n) is the Euler totient function A000010(n).at n=5A226459
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 302", based on the 5-celled von Neumann neighborhood.at n=36A271158
- a(n) = 3*(3*n+1)*(9*n+8)/2.at n=19A304504
- Numbers k such that 371*2^k+1 is prime.at n=24A323010
- Numbers that are the sum of nine fourth powers in ten or more ways.at n=31A345594
- Number of n-digit zeroless numbers whose digit sum is larger than the product of all digits.at n=17A360972