12708
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 18
- Divisor Sum
- 32214
- Proper Divisor Sum (Aliquot Sum)
- 19506
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4224
- Möbius Function
- 0
- Radical
- 2118
- 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
- 55
- 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 ways to partition n elements into pie slices of different sizes.at n=32A032153
- a(n)=a(n-1)+a(n-2)-d, where d=a(n/4) if 4 divides n, else d=0; 2 initial terms.at n=21A050194
- Numbers n such that p(10n) is prime, where p(n) is the number of partitions of n.at n=19A114170
- Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n and having k peaks of height >1 (n >= 1; 0 <= k <= n-1).at n=40A128747
- Number of 4-noncrossing stack-free partial matching without 1-arcs.at n=10A143657
- Indices of record values in A046641.at n=47A145772
- a(n) = Sum_{k=1..n} binomial(n,k) * gcd(k,n).at n=11A159068
- L.g.f.: Sum_{n>=1} x^n/n * Product_{d|n} (1 + d*x^d)^n.at n=11A205485
- Total number of parts of multiplicity 6 in all partitions of n.at n=40A222706
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 470", based on the 5-celled von Neumann neighborhood.at n=31A272421
- Numbers k such that Bernoulli number B_{k} has denominator 1919190.at n=7A295595
- Fibonacci with binary selection.at n=17A327665
- Triangle read by rows: T(n,m) (n >= m >= 1) = number of line segments formed by drawing the lines connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares.at n=25A331454
- Numbers that are the sum of nine fourth powers in nine or more ways.at n=19A345593
- Numbers that are the sum of nine fourth powers in ten or more ways.at n=1A345594
- Numbers that are the sum of nine fourth powers in exactly ten ways.at n=1A345852