12298
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 22176
- Proper Divisor Sum (Aliquot Sum)
- 9878
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5040
- Möbius Function
- 1
- Radical
- 12298
- Omega Function (Ω)
- 4
- 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
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 156
- 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(n) = n*(n+4)*(n+5)/6.at n=39A005586
- a(n) = Sum_{1 <= i < j <= n} (j-i)^3.at n=11A024166
- Numbers k whose decimal representation, read as a base-12 value and divided by k, yields an integer.at n=13A032555
- Number of partitions of n into parts not of the form 25k, 25k+10 or 25k-10. Also number of partitions with at most 9 parts of size 1 and differences between parts at distance 11 are greater than 1.at n=34A036009
- Partial sums of A051798.at n=9A051879
- Number of step cyclic shifted sequences using exactly three different symbols.at n=11A056416
- a(n) = C(3+n, n) + C(4+n, n) + C(5+n, n) + C(6+n, n).at n=10A062966
- Duplicate of A024166.at n=11A085437
- a(n) = min{ m : sum_{n <= i <= m} 1/p_i > 1}, where p_i is the i-th prime = A000040(i).at n=19A092325
- a(n) = (n-2)*(n+3)*(n+2)/6.at n=41A129936
- Successive differences of A000990.at n=26A147766
- 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), (0, 1, 1), (1, -1, 1), (1, 1, -1)}.at n=8A149054
- 13 times triangular numbers.at n=43A152741
- Expansion of (8+6*x)/(1-x)^5.at n=10A190048
- 13 times hexagonal numbers: a(n) = 13*n*(2*n-1).at n=22A194713
- 1/4 the number of (n+1) X 7 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences.at n=25A209725
- Number of (n+1) X (n+1) -11..11 symmetric matrices with every 2 X 2 subblock having sum zero and two or four distinct values.at n=9A211715
- Number of (n+1) X (1+1) 0..3 arrays with no element unequal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with values 0..3 introduced in row major order.at n=9A231356
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no element unequal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with values 0..3 introduced in row major order.at n=45A231363
- a(n) = cpg(3, n) + cpg(4, n) + ... + cpg(n, n) where cpg(m, n) is the n-th m-th-order centered polygonal number.at n=15A257052