14953
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 15760
- Proper Divisor Sum (Aliquot Sum)
- 807
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 14148
- Möbius Function
- 1
- Radical
- 14953
- 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
- 71
- 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
- Number of partitions satisfying cn(0,5) < cn(2,5) + cn(3,5).at n=35A039841
- Numbers k such that sigma(k) mod pi(k) = 1.at n=15A073723
- Number of parts > 1 in the last section of the set of partitions of n.at n=33A138135
- a(n) = 8*n^2 + 20*n + 1.at n=42A161617
- Numbers n with property that 42*n+37 is in A175284.at n=14A175285
- Number of parts in all partitions of 2n that do not contain 1 as a part.at n=17A182734
- Greatest number such that the number of contiguous palindromic bit patterns in its binary representation is n, or 0, if there is no such number.at n=26A217100
- a(1) = a(2) = 2; a(n) = a(n-1) + gpf(a(n-2)), where gpf is greatest prime factor.at n=40A258125
- Expansion of Sum_{k>0} x^(3*k)/(1-x^k)^4.at n=43A363607