9004
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 15764
- Proper Divisor Sum (Aliquot Sum)
- 6760
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4500
- Möbius Function
- 0
- Radical
- 4502
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- no
- Narcissistic Number
- no
- Collatz Steps
- 39
- 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
- Cluster series for bond percolation problem on hexagonal lattice.at n=6A003197
- Numbers that are the sum of 6 positive 7th powers.at n=24A003373
- Number of shapes of height-balanced AVL trees with n nodes.at n=19A006265
- Shapes of height-balanced AVL trees of height at most 5 with n nodes.at n=20A036662
- Interprimes which are of the form s*prime, s=4.at n=36A075279
- Numbers n not divisible by 10 such that the decimal representation of n^26 does not use every nonzero digit.at n=22A112258
- Number of quadruples [i,j,k,l] with all entries between 1 and n such that gcd(i,j) = gcd(k,l).at n=11A124162
- Number of shapes of height-balanced AVL trees of height at most 6 with n nodes.at n=20A134306
- Numbers m for which Sum_digits(m!) is a multiple of Sum_digits(m!!).at n=45A135206
- Triangle read by rows: T(n,k) = number of AVL trees of height n with k (leaf-) nodes, n>=0, fibonacci(n+2)<=k<=2^n.at n=24A143897
- Smallest sequence which lists the position of digits "8" in the sequence.at n=37A167450
- Triangle read by columns: T(n,k) = number of AVL trees of height n with k (leaf-) nodes, k>=1, A029837(k)<=n<A072649(k).at n=24A217298
- Number of height minimal AVL trees with n (leaf-) nodes.at n=19A217299
- Number of height maximal AVL trees with n (leaf-) nodes.at n=19A217300
- Fundamental discriminants of real quadratic number fields with class number 7.at n=15A218157
- Number of n X 2 0..3 arrays with every 0 next to a 1, every 1 next to a 2 and every 2 next to a 3 horizontally, vertically or antidiagonally, and no adjacent values equal.at n=6A232155
- Number of nX7 0..3 arrays with every 0 next to a 1, every 1 next to a 2 and every 2 next to a 3 horizontally, vertically or antidiagonally, and no adjacent values equal.at n=1A232160
- T(n,k)=Number of nXk 0..3 arrays with every 0 next to a 1, every 1 next to a 2 and every 2 next to a 3 horizontally, vertically or antidiagonally, and no adjacent values equal.at n=29A232161
- T(n,k)=Number of nXk 0..3 arrays with every 0 next to a 1, every 1 next to a 2 and every 2 next to a 3 horizontally, vertically or antidiagonally, and no adjacent values equal.at n=34A232161
- Consider a number n with m decimal digits, m>9. The sequence lists the numbers n such that the prefix of length m-1 and the suffix of length m-1 are both perfect squares.at n=32A244283