14991
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 21120
- Proper Divisor Sum (Aliquot Sum)
- 6129
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9432
- Möbius Function
- -1
- Radical
- 14991
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 71
- Smith Number
- yes
- 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
- Truncated triangular pyramid numbers: a(n) = (n-7)*(n^2 + 10*n - 108)/6, n >= 8.at n=37A051941
- McKay-Thompson series of class 39A for Monster.at n=48A058659
- Least number that requires exactly n iterations of f(x) = reverse(x) - maxdigit(x) to reach zero.at n=25A097156
- Numbers that set a new record for the number of iterations needed to reach 0 under f(x) = reverse(x) - maxdigit(x).at n=21A097158
- Index k of the first occurrence of A019565(2n-1) as the smallest term that makes prime(k)-A019565(2n-1) prime.at n=30A103792
- Difference between the n-th partial sum of the squares (A000330) and the n-th partial sum of the primes (A007504).at n=36A108753
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 1), (0, 0, -1), (0, 0, 1), (1, 0, 0)}.at n=8A150091
- a(n) is the least value of k such that the decimal expansion of n^k contains nine consecutive identical digits.at n=15A217164
- Index of record values in A247190.at n=37A250985
- Partial sums of A301692.at n=94A301693
- Number of compositions of n such that every subsequence has a different sum.at n=46A335357
- Number of quaternary steady words of length n (with respect to the permutations of symbols).at n=43A357250