12268
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 21476
- Proper Divisor Sum (Aliquot Sum)
- 9208
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6132
- Möbius Function
- 0
- Radical
- 6134
- 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
- 63
- 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 paraffins.at n=29A006001
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 72 ones.at n=13A031840
- a(n) = Sum_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604.at n=31A047881
- Excess of n + product of digits over next prime associated with A091628.at n=11A091632
- Numbers that reach the fixed point 89 under iteration of f(x) = reverse(x) - maxdigit(x).at n=19A097155
- Number of partitions of n into aliquant parts (i.e., parts that do not divide n).at n=51A098743
- Number of ways the set {1,2,...,n} can be split into two subsets of which the sum of one is twice the sum of the other.at n=20A113035
- Total sum of the sums of all positive k-th ranks of all partitions of n.at n=23A208483
- G.f.: Sum_{n>=0} (n+1) * x^n * (1 + x^n)^n.at n=87A326002
- Number of intersection points formed by drawing all least squares regression lines fitted to n points (j,y_j), 0 <= j < n, where each y_j is 0 or 1.at n=9A371437
- Triangle read by rows: T(n,k) is the number of 4-dimensional balanced ballot paths of 4n steps with exactly k peaks.at n=8A387936