15869
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18144
- Proper Divisor Sum (Aliquot Sum)
- 2275
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 13596
- Möbius Function
- 1
- Radical
- 15869
- Omega Function (Ω)
- 2
- 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
- 53
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- a(n) is the number of partitions of 2n that can be obtained by adding together two (not necessarily distinct) partitions of n.at n=17A002219
- 4th diagonal of triangle in A059317.at n=44A106058
- a(n) = 529*n - 1.at n=29A158365
- a(n) = 49*n^2 - 7.at n=17A158484
- a(n) = 30*n^2 - 1.at n=22A158560
- Number of odd entries in the character table of the symmetric group S_n.at n=16A274691
- Number of partitions of n which can themselves be subdivided into two partitions whose sums differ by 1 at most.at n=36A276107
- a(n) is the length of stage n in A137844.at n=13A291754
- Number of nX3 0..1 arrays with every element unequal to 1, 2, 4, 5, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=9A317453
- Number of binary carry-connected subsets of {1...n}.at n=14A325105
- Numbers k such that 20^k - 3 is prime.at n=19A339922
- Number of ways to write n as an ordered sum of seven positive Fibonacci numbers (with a single type of 1).at n=33A357694