12744
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
- 3
Divisibility
- Divisor Count
- 32
- Divisor Sum
- 36000
- Proper Divisor Sum (Aliquot Sum)
- 23256
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4176
- Möbius Function
- 0
- Radical
- 354
- Omega Function (Ω)
- 7
- 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
- yes
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 125
- 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 ordered positive integer solutions (m_1, m_2, ..., m_k) (for some k) to Sum_{i=1..k} m_i=n with |m_i-m_{i-1}| <= 1 for i = 2 ... k.at n=19A034297
- Coefficients of a power series whose convolution consists of only the even-indexed terms of the sequence.at n=42A073707
- Coefficients of a power series whose convolution consists of only the even-indexed terms of the sequence.at n=43A073707
- Generating function A(x) satisfies A(x) = (1+x)^2*A(x^2)^2, with A(0)=1.at n=21A073708
- a(0)=1, a(1)=4, a(n) = 8*a(n-1) - 14*a(n-2), n >= 2.at n=6A083879
- a(n) = a(n-1) + a(n-2) - a(n-3) + a(n-5).at n=32A107368
- Numbers with at least two 3s in their prime signature.at n=30A109399
- a(n) = 13 + floor(Sum_{j=1..n-1} a(j)/3).at n=24A120157
- E.g.f. satisfies: A'(x) = 1 + x*A(x)^3 where A(0) = 1.at n=7A144013
- 4 times heptagonal numbers: a(n) = 2*n*(5*n-3).at n=36A153784
- Those positive integers n where, when written in binary, there are exactly k number of runs (of either 0's or 1's) each of exactly k length, for all k where 1<=k<=m, for some positive integer m.at n=22A175356
- Even numbers that can only be expressed as the sum of two distinct twin prime pairs in two ways: n = p+(q+2) = (p+2)+q where (3,5) < (p,p+2) < (q,q+2).at n=74A179014
- Numbers of the form p^3*q^3*r where p, q, and r are prime.at n=19A179688
- Number of (n+1)X(n+1) 0..4 arrays with the permanents of all 2X2 subblocks equal and nonzero.at n=1A204724
- Number of (n+1)X3 0..4 arrays with the permanents of all 2X2 subblocks equal and nonzero.at n=1A204726
- T(n,k) = Number of (n+1) X (k+1) 0..4 arrays with the permanents of all 2X2 subblocks equal and nonzero.at n=4A204732
- Number of nonisomorphic graded posets with 0 and non-uniform Hasse graph of rank n, with no 3-element antichain.at n=8A206949
- Number of (w,x,y,z) with all terms in {1,...,n} and 3w = x + y + z + n + 1.at n=36A212251
- Number T(n,k) of permutations of [n] with exactly k ascents from odd to even numbers; triangle T(n,k), n>=0, 0<=k<=floor(n/2), read by rows.at n=22A231777
- Expansion of (1+6*x+16*x^2+8*x^3+x^4)/(1-x)^8.at n=6A244883