14552
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 29160
- Proper Divisor Sum (Aliquot Sum)
- 14608
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 6784
- Möbius Function
- 0
- Radical
- 3638
- Omega Function (Ω)
- 5
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 164
- 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
- yes
- Odd
- no
Appears in sequences
- Number of partitions of 2n with all subsums different from n.at n=24A006827
- Molien series for alternating group Alt_12 (or A_12).at n=37A008635
- Number of partitions of n into at most 12 parts.at n=37A008641
- Multiplicity of highest weight (or singular) vectors associated with character chi_135 of Monster module.at n=42A034523
- Number of primes between n^4 and (n+1)^4.at n=37A061235
- a(n) = n*(n+1)*(n^2 - 3*n + 6)/4.at n=16A062026
- Number of partitions of the n-th prime into integers <= n.at n=11A092298
- a(n) = 441*n - 1.at n=32A158319
- G.f. satisfies: A(x) = exp( Sum_{n>=1} C(2*n,n)/2 * A(x^n) * x^n/n ).at n=9A199137
- Number of length 4 1..(n+1) arrays with every leading partial sum divisible by 2, 3, 5, 7 or 11.at n=12A254951
- Alternating sum of heptagonal pyramidal numbers.at n=32A269428
- Number of partitions p of n such that min(p) <= (number of parts of p) < max(p).at n=38A325341
- Infinitary Zumkeller numbers (A335197) whose set of infinitary divisors can be partitioned into two disjoint sets of equal sum in a single way.at n=43A335199
- a(n) = Sum_{j=1..n} Sum_{k=1..n} phi(2*j*k) / phi(k).at n=27A372664
- Numbers which can be written in precisely one way as sum of a subset of their proper divisors and that have exactly one subset of their divisors such that the complement has the same sum.at n=41A378530
- Primitive terms of A388028.at n=40A388030