15957
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 5
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 23958
- Proper Divisor Sum (Aliquot Sum)
- 8001
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10584
- Möbius Function
- 0
- Radical
- 591
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 53
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that k divides 9^k + 8^k + 7^k.at n=14A057231
- a(n) = A064835(n)/2.at n=19A064836
- L-th order palindromes with L > 2.at n=6A089381
- Nonnegative values x of solutions (x, y) to the Diophantine equation x^2+(x+167)^2 = y^2.at n=8A130608
- Numerator of the cumulative frequency of the dropping time in the Collatz iteration.at n=12A186109
- Numbers k such that the first 9 digits of the k-th Lucas number are 1-9 pandigital.at n=3A216489
- a(n) = (n+1)*(n^3+15*n^2+74*n+132)/12.at n=17A217947
- T(n,k)=Number of ways to reciprocally link elements of an nXk array either to themselves or to exactly one horizontal or antidiagonal neighbor.at n=46A220562
- Number of ways to reciprocally link elements of an 2 X n array either to themselves or to exactly one horizontal or antidiagonal neighbor.at n=8A220563