12652
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
- 22148
- Proper Divisor Sum (Aliquot Sum)
- 9496
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6324
- Möbius Function
- 0
- Radical
- 6326
- 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
- yes
- Harshad Number
- no
- 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
- Numbers k such that k^2 + 3*k + 1 is a palindrome.at n=22A028348
- Whitney transform of 3^n.at n=7A103820
- Sum of the sizes of the tails below the Durfee squares of all partitions of n.at n=23A116365
- Expansion of 1/(1 - x^3 - x^4 + x^7 - x^10 - x^11 + x^14) (a Salem polynomial).at n=59A143644
- Number of factorizations of m^n into n factors, where m is a product of exactly 4 distinct primes and each factor is a product of 4 primes (counted with multiplicity).at n=6A257114
- Number A(n,k) of factorizations of m^n into n factors, where m is a product of exactly k distinct primes and each factor is a product of k primes (counted with multiplicity); square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=61A257462
- Triangle read by rows: T(n,k) is the number of compositions without 2's and having asymmetry degree equal to k (n>=0; 0<=k<=floor(n/4)).at n=62A275442
- Expansion of Product_{k>=1} ((1 + x^k) / (1 + x^(5*k)))^k.at n=19A285291
- G.f. A(x) satisfies: A(x) = (1 + x * A(x)^2) / (1 - x + 2 * x^2).at n=8A346505