9594
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 22932
- Proper Divisor Sum (Aliquot Sum)
- 13338
- 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
- 2880
- Möbius Function
- 0
- Radical
- 3198
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 73
- 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
- Coordination sequence for root lattice B_3.at n=22A022145
- a(n) = 6*n^2 + 12*n.at n=38A067726
- Numbers k such that phi(k) = bigomega(k)*tau(k)^2.at n=21A068540
- G.f.: (1-2*x+2*x^2-x^3+x^4-x^5+2*x^6-2*x^7+x^8)/((1-x)^2*(1-x^2)*(1-x^3)*(1-x^6)).at n=51A127825
- Partial sums of A061262.at n=24A176661
- Triangular array: the fusion of (p(n,x)) by (q(n,x)), where p(n,x)=sum{(k+1)(n+1)*x^(n-k) : 0<=k<=n} and q(n,x)=sum{F(k+1)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers).at n=54A193951
- Mirror of the triangle A193951.at n=45A193952
- Number of n X 2 0..5 arrays with every row and column nondecreasing rightwards and downwards, and the number of instances of each value within one of each other.at n=13A201136
- Numbers a = b + c where a, b, and c contain the same decimal digits.at n=21A203024
- Number of partitions p of n such that (number of distinct parts of p) <= max(p) - min(p).at n=33A239955
- Triangle read by rows in which T(n,k) is the number of permutations avoiding 132 of length n with an independent set of size k in its coregraph.at n=46A262370
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 62", based on the 5-celled von Neumann neighborhood.at n=28A270081
- Number of ways to transform a sequence of n zeros and n ones to a single number by continually removing two numbers and replacing them with their sum modulo 3.at n=6A276028
- Number of (not necessarily maximal) cliques in the n X n knight graph.at n=44A295905
- Expansion of Product_{r not a perfect power} 1/(1 - x^r).at n=53A305631
- Numbers k such that A037276(k) == -1 (mod k).at n=10A351975
- Partial sums of A365412.at n=41A365442
- Expansion of (1/x) * Series_Reversion( x / ((1+x)^2+x^3) ).at n=8A369212
- Number of polyforms with n cells on the faces of a tetrakis hexahedron up to rotation.at n=15A383803
- Number of polyforms with n cells on the faces of a tetrakis hexahedron up to tetrahedral symmetry.at n=15A383827