12024
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 32760
- Proper Divisor Sum (Aliquot Sum)
- 20736
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3984
- Möbius Function
- 0
- Radical
- 1002
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 143
- 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
- Expansion of e.g.f.: arcsin(arcsinh(x)*log(x+1)).at n=8A012574
- a(n) = floor(exp(20/23) * n!).at n=6A030809
- Numbers k such that sigma(k) divides sigma(sigma(k)).at n=34A066961
- Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=2, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the six-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).at n=56A079222
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={4}.at n=15A079967
- a(0)=1; a(n) = sigma_1(n) + sigma_3(n).at n=22A092345
- Positive integers i for which A112049(i) == 7.at n=32A112067
- Half the number of nX2 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.at n=5A183577
- Half the number of nX6 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.at n=1A183581
- T(n,k)=Half the number of nXk 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.at n=22A183584
- T(n,k)=Half the number of nXk 0..3 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors.at n=26A183584
- Number of (w,x,y) with all terms in {0,...,n} and the numbers w,x,y,|w-x|,|x-y|,|y-w| distinct.at n=26A213493
- Braille natural numbers (including zero), using "0" as digit concatenation mark.at n=29A220090
- Expansion of (1+4*x+8*x^2-x^3)/((1-x)*(1+x)*(1-3*x^2)).at n=14A224785
- a(n) = (n^4 + 2*n^3 - n^2)/2.at n=12A255499
- Numbers such that the decimal digits of sigma(n) are a permutation of those of sigma(n)-n.at n=7A277114
- Infinitary aliquot sequence starting at 6216.at n=1A293355
- Numbers k such that Bernoulli number B_{k} has denominator 140100870.at n=1A295599
- a(1)=1, a(2)=2; thereafter a(n+1) = Sum_{i=m..n} a(i) where m = (n+1)-k and k is the last digit of a(n), except if k=0, k=1, or k>n then a(n+1) = Sum_{i=1..n} a(i).at n=15A309311
- a(n) = (n + 1)^2*a(n - 2) + a(n - 1), starting 0, 9, ....at n=5A335026