12446
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21888
- Proper Divisor Sum (Aliquot Sum)
- 9442
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5292
- Möbius Function
- 0
- Radical
- 1778
- Omega Function (Ω)
- 4
- 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
- 37
- 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 bracelets (turnover necklaces) of n beads of 2 colors, 5 of them black.at n=39A032279
- If D[n] is divisor-set of n, then in set of 1+D only 2 primes occur:{2,3}; also n is not squarefree.at n=36A072607
- Smallest multiple of n-th prime which is == 1 mod (n+1)-st prime.at n=30A073603
- G.f.: (1+x)/Product_{m>0} (1 - x^m).at n=31A084376
- G.f.: (1+x^2)^2*(x^4-6*x^3+1)/(x^2-1)^4.at n=42A115046
- Number of benzenoids with 23 hexagons, C_(2h) symmetry and containing 2n carbon atoms.at n=6A123141
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, 0, 0), (-1, 1, 1), (1, -1, 1), (1, 1, 0)}.at n=8A149309
- Numbers k such that 3*k is a partition number.at n=17A213365
- Numbers m such that the GCD of the x's that satisfy sigma(x) = m is 4.at n=12A241649
- Riordan array (1/(1-2*x), x*C(x)) where C(x) is the o.g.f. of Catalan numbers A000108.at n=57A247023
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 179", based on the 5-celled von Neumann neighborhood.at n=25A270624
- Expansion of Product_{k>=1} 1 / (1 - x^(2*k - 1))^(k*(3*k - 2)).at n=14A294691
- Number of nX3 0..1 arrays with every element unequal to 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=8A316735
- T(n,k) = Number of n X k 0..1 arrays with every element unequal to 1, 2, 3, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=57A316740
- Expansion of Sum_{k>=1} ((1 + k * x^k)^k - 1).at n=20A327238
- The smallest of 3 consecutive integers such that the first is divisible by the square of a prime, the second is divisible by the cube of a prime, and the third is divisible by the fourth power of a prime.at n=5A349952
- Expansion of e.g.f. 1 / (1 - x)^cosh(x).at n=7A351881
- E.g.f. satisfies A(x) = (1+x)^(A(x)^x).at n=7A362794