12901
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15680
- Proper Divisor Sum (Aliquot Sum)
- 2779
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10368
- Möbius Function
- -1
- Radical
- 12901
- Omega Function (Ω)
- 3
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 63
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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 96.at n=38A020224
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 56 ones.at n=34A031824
- a(n) = least k such that the remainder when 14^k is divided by k is n.at n=20A128154
- Products of three distinct happy primes A035497.at n=16A154717
- Products of three distinct primes of the form 6*k + 1.at n=26A154729
- Number of regions in a complete but borderless regular polygon.at n=20A191101
- Numbers having exactly four representations by the quadratic form x^2+xy+y^2 with 0<=x<=y.at n=37A198775
- Number of zero-sum -n..n arrays of 5 elements with first and second differences also in -n..n.at n=9A201876
- Triangular array read by rows: row n shows the coefficients of the polynomial u(n) = c(0) + c(1)*x + ... + c(n)*x^(n) which is the denominator of the n-th convergent of the continued fraction [k, k, k, ... ], where k = (x + 1)/(x + 2).at n=45A231775
- Nonprimes such that it takes exactly 4 iterations of reverse-and-add digits to generate a prime.at n=28A245209
- The broken eggs problem.at n=30A256101
- Least integer k>1 such that sqrt(k)/log(k) exceeds n.at n=11A262058
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 217", based on the 5-celled von Neumann neighborhood.at n=26A270911
- Number of odd partitions in the multiset of intersections of the set of partitions of n with itself; also number of distinct partitions in that multiset.at n=14A274521
- G.f.: Product_{k>=1} (1 + x^k) / (1 - x^(k*(k+1)/2)).at n=32A280422
- Numbers k such that (29*10^k - 77)/3 is prime.at n=22A280942
- a(n) = n*((4*n + 1)*(7*n - 4) + 15*n*(-1)^n)/48.at n=27A302766
- Number of compositions (ordered partitions) of the n-th prime into distinct prime parts.at n=19A331901
- Number of ways to write n as an ordered sum of 7 prime powers (including 1).at n=12A341136
- Index of n-th prime in A386482, or -1 if that prime is missing.at n=51A386483