14585
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17508
- Proper Divisor Sum (Aliquot Sum)
- 2923
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11664
- Möbius Function
- 1
- Radical
- 14585
- 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
- 102
- 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
- Pseudoprimes to base 54.at n=35A020182
- Numbers k such that the continued fraction for sqrt(k) has period 57.at n=26A020396
- a(n)^2 is the smallest square containing exactly n 2's.at n=5A048347
- Numbers k such that 189*2^k-1 is prime.at n=35A050846
- Solution to the non-squashing boxes problem (version 1).at n=35A089054
- a(1) = 2, a(n) = a(n-1) + 3*(a(n-1)-floor(a(n-1)^(1/3))^3).at n=21A096295
- a(n) = BS2(n) * W(n) where BS2 = sum_{k=0..n} ((-1)^k*k!/(k+1)) S_{2}(n, k) and S_{2}(n, k) are the Stirling-Frobenius subset numbers A039755(n, k). W(n) = product{p primes <= n+1 such that p divides n+1 or p-1 divides n} = A225481(n).at n=9A226157
- Number of partitions of n such that (least part) >= (multiplicity of least part).at n=43A240177
- Numbers k such that 429*2^k+1 is prime.at n=39A323115