14524
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 25424
- Proper Divisor Sum (Aliquot Sum)
- 10900
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7260
- Möbius Function
- 0
- Radical
- 7262
- Omega Function (Ω)
- 3
- 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
- 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
- Largest number not the sum of distinct n-th-order polygonal numbers.at n=37A007419
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/29 ).at n=27A011939
- a(n) = floor(Sum_{m=1..n} Stirling2(n,m) / binomial(n-1,m-1)).at n=11A024422
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 84 ones.at n=6A031852
- Number of chordal graphs (or triangulated graphs) on n vertices.at n=8A048193
- Ceiling(n^2*exp(n)).at n=5A132413
- Numbers k such that k! - (k-1)! + (k-2)! + 1 is prime.at n=22A157829
- Triangle read by rows: the Fibonacci triangle times Pascal's triangle (A007318).at n=48A201166
- Number of partitions n such that the multiplicity of the number of even parts is a part.at n=41A240540
- G.f. = b(2)*b(4)*b(6)/(x^8-x^3-x+1), where b(k) = (1-x^k)/(1-x).at n=21A266338
- Least number x such that x^n has n digits equal to k. Case k = 3.at n=15A285450
- Indices i in A112058 where records of 17*i - 3*A112058(i)/8 occur.at n=21A298991
- Sum of the corners of a 2n+1 X 2n+1 square spiral.at n=29A325958
- Number of integer partitions of n that are all 1's or whose run-lengths cover an initial interval of positive integers.at n=42A332576
- Index of first occurrence of -n in A000319, or -1 if -n never appears there.at n=12A381231