12992
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 28
- Divisor Sum
- 30480
- Proper Divisor Sum (Aliquot Sum)
- 17488
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5376
- Möbius Function
- 0
- Radical
- 406
- Omega Function (Ω)
- 8
- 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
- 45
- 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
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite CHI = Chiavennite Ca4Mn4[Be8Si20O52(OH)8].8H2O starting with a T3 atom.at n=14A019093
- Number of sums S of distinct positive integers satisfying S <= n.at n=42A026906
- a(n) = 2^n*Bell(n). E.g.f.: exp(exp(2*x)-1).at n=6A055882
- a(n) = A055993(n) - A034444(A056627(n)).at n=33A056630
- Numbers which are the sum of their proper divisors containing the digit 4.at n=21A059463
- a(n) = binomial(2*n,n) mod ((n+1)*(n+2)*(n+3)).at n=26A065345
- Engel expansion of zeta(4) = Pi^4/90 = Sum_{i>0} 1/i^4.at n=8A067912
- Number of isomorphism classes of non-associative non-commutative anti-associative non-anti-commutative closed binary operations on a set of order n, listed by class size.at n=14A079204
- Structured rhombic triacontahedral numbers (vertex structure 11).at n=11A100164
- Triangle read by rows: T(n,k) = S1(n,k)*2^k, where S1(n,k) is an unsigned Stirling number of the first kind (cf. A008275) (n >= 1, 1 <= k <= n).at n=23A125553
- Coefficients of generalized factorial polynomials p(x, n) = (x/a - (n-1))*p(x, n-1) with p(x, 0) = 1, p(x, 1) = x/a and a = 1/2. Triangle read by rows, for n >= 0 and 0 <= k <= n.at n=31A137312
- Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1)*p(x, n - 1) with p[x, 0] = 1, p[x, -1] = 0, p[x, 1] = m*x and m = 2. Triangle read by rows, for n >= 0 and 0 <= k <= n.at n=31A137320
- Numbers with 28 divisors.at n=38A137491
- 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, 1), (1, 0, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150820
- Riordan array [exp(-x/2)(1-2x)^(-1/4),x].at n=39A152148
- Products of the 6th power of a prime and 2 distinct primes (p^6*q*r).at n=35A179672
- Triangular array read by rows: T(n,k) = number of fixed points in the permutations of {1,2,...,n} that have exactly k cycles; n>=1, 1<=k<=n.at n=31A180013
- A generalized Narayana triangle for sec(x)^2.at n=39A180960
- A generalized Narayana triangle for sec(x)^2.at n=41A180960
- Number of ways to place n nonattacking composite pieces rook + rider[3,3] on an n X n chessboard.at n=7A189839