12628
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
- 24
- Divisor Sum
- 28224
- Proper Divisor Sum (Aliquot Sum)
- 15596
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4800
- Möbius Function
- 0
- Radical
- 6314
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 32
- 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 nonequivalent dissections of an n-gon into 3 polygons by nonintersecting diagonals rooted at a cell up to rotation and reflection.at n=43A003452
- Quadrinomial coefficients: C(2+n,n) + C(3+n,n) + C(4+n,n).at n=20A005718
- Coordination sequence for MgNi2, Position Ni2.at n=28A009932
- a(n) = n*(15*n + 1)/2.at n=41A022273
- Numerators of continued fraction convergents to sqrt(791).at n=2A042524
- a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1.at n=14A049942
- Number of rooted trees with n nodes and 4-colored non-root nodes.at n=6A052763
- Number of polyiamonds with n cells that tile the plane isohedrally.at n=14A075223
- Minimal m such that n^n-m and n^n+m are both primes, or -1 if there is no such m.at n=37A075468
- TrueSoFar terminating terms in other bases.at n=7A102843
- Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k columns of even length (0 <= k < n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=42A121748
- Numbers m such that UnitarySigma(m)^2 = k*Sigma(m)*UnitaryPhi(m), for some integer k.at n=34A123041
- G.f. is the polynomial (Product_{k=1..22} (1 - x^(3*k)))/(1-x)^22.at n=4A162679
- Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing cycles of length >=2 (0<=k<= n/2). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) < b(2) < b(3) < ... .at n=28A186757
- Number of ways to place n nonattacking composite pieces queen + rider[3,5] on an n X n chessboard.at n=13A189880
- Numbers k such that 26*k+1 is a square.at n=44A217441
- Numbers n having at least two distinct symmetrical pairs of divisors (a, b) and (b', a') such that n = a*b = b'*a' with a' = reverse(a) and b' = reverse(b).at n=24A228164
- Total sum of cubes of parts in all partitions of n.at n=11A229325
- a(n) = n*prime(prime(n)) - prime(n).at n=24A230285
- Number A(n,k) of rooted trees with n nodes and k-colored non-root nodes; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=61A242249