9062
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14256
- Proper Divisor Sum (Aliquot Sum)
- 5194
- 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
- 4312
- Möbius Function
- -1
- Radical
- 9062
- Omega Function (Ω)
- 3
- 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
- yes
- 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
- Least term in period of continued fraction for sqrt(n) is 5.at n=30A031429
- Numbers whose set of base-14 digits is {3,4}.at n=19A032838
- Number of partitions satisfying cn(1,5) + cn(4,5) <= cn(2,5) + cn(3,5).at n=36A039894
- A card-arranging problem: values of n such that there exists a permutation p_1, ..., p_n of 1, ..., n such that i + p_i is a fifth power for every i.at n=32A096906
- Expansion of 1/(1-x^2-x^3-x^6).at n=30A121833
- Indices of products of twin primes in the semiprimes.at n=13A131188
- n times the n-th noncomposite.at n=45A164931
- Index k of the semiprime A001358(k) = prime(n) * prime(n+1).at n=42A172348
- Expansion of 1/(1 - x - x^8 - x^15 + x^16).at n=47A173925
- Numbers that are the product of 3 distinct primes a,b and c, such that a^2+b^2+c^2 is the average of a twin prime pair.at n=40A176879
- Number of partitions p of n such that max(p)-min(p) = 8.at n=36A218571
- Number of identity trees with n nodes where the maximal outdegree (branching factor) equals 8.at n=5A245753
- Number of (n+2)X(1+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum less than 3.at n=2A252441
- Number of (n+2)X(3+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum less than 3.at n=0A252443
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum less than 3.at n=3A252447
- T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum less than 3.at n=5A252447
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 86", based on the 5-celled von Neumann neighborhood.at n=34A270127
- Numbers n such that Bernoulli number B_{n} has denominator 282.at n=25A272184
- Coefficients in the expansion of 1/([r] + [2r]x + [3r]x^2 + ...); [ ] = floor, r = sqrt(3).at n=32A279588
- Numbers k such that 3 is the smallest decimal digit of k^4.at n=26A291671