12998
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19992
- Proper Divisor Sum (Aliquot Sum)
- 6994
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6336
- Möbius Function
- -1
- Radical
- 12998
- Omega Function (Ω)
- 3
- 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
- 138
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- a(0) = 1, a(n) = 9*n^2 + 2 for n>0.at n=38A010002
- Expansion of 1/((1-4*x)*(1-9*x)*(1-10*x)*(1-11*x)).at n=3A028161
- Number of partitions of n with equal number of parts congruent to each of 2, 3 and 4 (mod 5).at n=56A035581
- Numbers k such that the numerator of Bernoulli(2k) is divisible by the square of 67, the third irregular prime.at n=13A093059
- Largest achievable determinant of a 3 X 3 matrix whose elements are 9 distinct integers chosen from the range -n...n.at n=12A097693
- Positive integers k such that k^20 + 1 is semiprime (A001358).at n=42A105282
- Numbers k such that k times phi(k) is a palindrome.at n=19A115891
- Number of 4-step one space leftwards or up, two space rightwards or down asymmetric rook's tours on an n X n board summed over all starting positions.at n=16A187299
- Numbers n such that there is no triangular n-gonal number greater than 1.at n=28A188892
- Total area of the shadows of the three views of a three-dimensional version of the shell model of partitions with n shells.at n=19A207380
- Govindarajan's triangle D arising in enumeration of multi-dimensional partitions, read by rows.at n=52A216804
- Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having a sum of zero, with rows and columns of the latter in lexicographically nondecreasing order.at n=23A227121
- Number of (n+1)X(2+1) 0..3 arrays with every 2X2 subblock summing to a prime.at n=1A251453
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock summing to a prime.at n=4A251459
- Partial sums of A253088.at n=27A255048
- Number of (n+2)X(n+2) 0..1 arrays with no 3x3 subblock diagonal sum 1 and no antidiagonal sum 2 and no row sum 0 and no column sum 3.at n=26A255793
- Numbers x = concat(a,b) such that b^a begins with the digits of x.at n=10A266817
- a(n) is the sum of the base-b representations of n for 2 <= b <= n+1 read in base ten.at n=31A289335
- G.f. A(x) = Sum_{n>=0} a(n)*x^n satisfies A(x) = 1/(1 - x^a(1) - x^a(2)/(1 - x^a(3) - x^a(4)/(1 - x^a(5) - x^a(6)/(1 - ... )))), a continued fraction.at n=18A293855
- a(n) = Sum_{k=1..n} sigma_3(k) * floor(n/k).at n=13A356043