12900
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 38192
- Proper Divisor Sum (Aliquot Sum)
- 25292
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3360
- Möbius Function
- 0
- Radical
- 1290
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 63
- 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
- McKay-Thompson series of class 24I for Monster.at n=27A058579
- Rewrite 0->100 in the binary expansion of n.at n=36A080303
- Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n containing k U H^j Us for some j>0, where U=(1,1) and H=(1,0) (can be easily expressed using RNA secondary structure terminology).at n=33A097777
- a(n)=4a(n-1)+C(n+3,3),n>0, a(0)=1.at n=6A097788
- Number of peakless Motzkin paths with no U H...HU's where U=(1,1) and H=(1,0) (can be easily expressed using RNA secondary structure terminology).at n=15A098051
- Antidiagonal sums of table A060543.at n=7A108289
- Triangle of numbers, called Y(1,3), related to generalized Catalan numbers A064063(n) = C(3;n).at n=19A116868
- Number of partitions of n with odd crank.at n=38A124228
- a(n) = Sum_{i=n..n+1} Sum_{j=i+1..n+2} Sum_{k=j+1..n+3} prime(i)*prime(j)*prime(k).at n=4A127349
- McKay-Thompson series of class 24I for the Monster group with a(0) = 2.at n=27A138688
- n, ps(n), ps^2(n), ..., ps^9(n) forms an increasing ps-sequence of length 10.at n=0A158918
- 1/729 the number of (n+2) X 3 0..2 arrays with no 3 X 3 subblock trace equal to any horizontal or vertical neighbor 3 X 3 subblock trace.at n=2A185883
- 1/729 the number of (n+2)X5 0..2 arrays with no 3X3 subblock trace equal to any horizontal or vertical neighbor 3X3 subblock trace.at n=0A185885
- T(n,k)=1/729 the number of (n+2)X(k+2) 0..2 arrays with no 3X3 subblock trace equal to any horizontal or vertical neighbor 3X3 subblock trace.at n=3A185891
- T(n,k)=1/729 the number of (n+2)X(k+2) 0..2 arrays with no 3X3 subblock trace equal to any horizontal or vertical neighbor 3X3 subblock trace.at n=5A185891
- a(n) = 2*n*(7*n + 5).at n=30A195027
- Number of triple-crossings of diagonals in the regular 2n-gon.at n=23A260417
- a(n) = n*(n + 7)*(n + 14)/6.at n=36A264444
- Triangle read by rows, T(n,k) = n!*B(n,k) for n>=0 and 0<=k<=n, where B(n,k) is the Bell matrix with generator 1/j for j>=1.at n=25A265607
- a(n) is the sum of the base-b representations of n for 2 <= b <= n+1 read in base ten.at n=29A289335