9084
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 21224
- Proper Divisor Sum (Aliquot Sum)
- 12140
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3024
- Möbius Function
- 0
- Radical
- 4542
- Omega Function (Ω)
- 4
- 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
- 65
- 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
- Base-3 digits are, in order, the first n terms of the periodic sequence with initial period 1,1,0.at n=8A033130
- Discriminants of real quadratic number fields K with class number 2 such that the Hilbert class field of K is K(sqrt(3)).at n=46A052477
- A simple grammar: power set of pairs of sequences.at n=22A052812
- Numbers k such that k | sigma_6(k) + phi(k)^6.at n=14A055700
- Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book.at n=12A061364
- Numbers k such that z(k) = j(k), where z(k) = sopf(k - d(k)), j(k) = d(sopf(k) + k), sopf(k) = A008472(k) and d(k) = A000005(k).at n=16A063961
- A145312(n)/1440.at n=7A145346
- Apply partial sum operator thrice to sequence of squares of the first n primes.at n=8A157493
- Expansion of (theta_2(q)^8 + 4 * theta_2(q^2)^8) / 256 in powers of q^2.at n=17A204386
- Triangle of coefficients of polynomials u(n,x) jointly generated with A210867; see the Formula section.at n=51A210866
- Numbers k such that Bernoulli number B_k has denominator 2730.at n=34A249134
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 145", based on the 5-celled von Neumann neighborhood.at n=24A270288
- Numbers n that have an equal number of even and odd values of A001221(k) for 1 <= k <= n.at n=39A275547
- Engel expansion of plastic constant (real root of x^3 - x - 1).at n=13A278766
- Number of nX5 0..1 arrays with every element equal to 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=3A301948
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=31A301951
- Number of 4Xn 0..1 arrays with every element equal to 1, 2 or 3 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=4A301953
- a(n) is the permanent of the n X n matrix A(n) that is defined as A[i,j,n] = n - abs((n + 1)/2 - i) - abs((n + 1)/2 - j).at n=5A349107
- Number of ways that n can be expressed as a sum of consecutive integers from 0 up to at most n, where any of the terms in the sum can be negated, and the partial sum from 0 is always between 0 and n inclusive.at n=54A364721
- Expansion of g.f. A(x) satisfying A(x)^3 = A( (x - A(x))*(A(x) - 2*x) ).at n=6A374564