8994
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 30
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 18000
- Proper Divisor Sum (Aliquot Sum)
- 9006
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2996
- Möbius Function
- -1
- Radical
- 8994
- 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
- 47
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 94.at n=12A031592
- Numbers whose set of base-16 digits is {2,3}.at n=18A032816
- Number of partitions of n with equal nonzero number of parts congruent to each of 0, 1 and 3 (mod 4).at n=54A046779
- Numbers which are the sum of their proper divisors containing the digit 9.at n=27A059468
- Numbers k such that the number of distinct primes dividing k = number of anti-divisors of k.at n=45A073713
- Pseudo-random numbers: gcc 2.6.3 version for 32-bit integers.at n=26A084276
- Cardinality of set of sets of parts of all partitions of n.at n=42A088314
- Number of rooted generalized quadrangular dissections of weight n of a closed disk: planar maps having the external face bounded by a polygon and all internal faces of size 4.at n=6A090376
- a(n) = floor(11^n/4^n).at n=9A094982
- Numbers k such that the k-th and (k+1)-th primes have the same sum of squares of digits.at n=37A109182
- Record gaps between twin primes.at n=41A113274
- Members of 3-cycles of permutation A111273.at n=7A113701
- Triangle, read by rows, where row n lists the coefficients of x^k, k=1..2^n, in the n-th iteration of (x + x^2) for n>=0.at n=39A122888
- a(n) = 529*n + 1.at n=16A158368
- Unhappy numbers which enter the cycle (4, 16, 37, 58, 89, 145, 42, 20) at 20.at n=44A193572
- a(n) equals the coefficient of x^(2*n-1) in the n-th iteration of x+x^2 for n>=1.at n=4A194971
- Number of (n+2) X 3 binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=6A202525
- Number of (n+2) X 9 binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=0A202531
- T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=21A202532
- T(n,k) = Number of (n+2) X (k+2) binary arrays avoiding patterns 000 and 101 in rows, columns and nw-to-se diagonals.at n=27A202532