8996
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 32
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 17052
- Proper Divisor Sum (Aliquot Sum)
- 8056
- 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
- 4128
- Möbius Function
- 0
- Radical
- 4498
- 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
- yes
- 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
- 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
- Number of lines through exactly 5 points of an n X n grid of points.at n=42A018812
- Number of partitions satisfying (cn(2,5) = cn(3,5) and cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5)).at n=45A036805
- Nearest integer to ratio of volume of n-dimensional cube of side 2 to volume of n-dimensional ball of radius 1.at n=13A057649
- Sum of digits = 8 times number of digits.at n=33A061425
- Partial sums of A068058 + 1.at n=39A068059
- One-sixtieth of the even leg of Pythagorean triangles whose other sides are both primes (other than 3, 5 or 13).at n=31A068485
- a(0)=0, a(1)=1; thereafter a(n) = ceiling((3/2)^(n-3)*n*(n-1)).at n=13A120414
- a(n) = ceiling(A000931(n)/2).at n=37A173692
- Numbers such that the largest prime factor equals the sum of the squares of the other prime factors.at n=44A185077
- Number of (n+2) X 7 binary arrays avoiding patterns 001 and 110 in rows, columns and nw-to-se diagonals.at n=5A202444
- Number of (n+2) X 8 binary arrays avoiding patterns 001 and 110 in rows, columns and nw-to-se diagonals.at n=4A202445
- Number of 5 X 5 0..n matrices with each 2 X 2 subblock idempotent.at n=40A224667
- The Wiener index of the graph obtained by applying Mycielski's construction to the crown graph G(n) (n>=3).at n=23A228598
- G.f.: x^(k^2)/(mul(1-x^(2*i),i=1..k)*mul(1+x^(2*r-1),r=1..oo)) with k=3.at n=45A246579
- Number of permutations p of [n] such that p(i) > p(i+1) iff i == 1 (mod 9).at n=14A250265
- Natural numbers n that have the property that starting from k = n, the fixed point of the map k -> floor(tan(k)) is strictly positive, while the smallest number encountered during the iteration is strictly negative.at n=55A258202
- a(n) = (n+1)!*Sum_{k=0..(n-1)/2}((k)!*stirling2(n-k,k+1)/(n-k)!/(k+1)).at n=7A270367
- a(1) = 0, a(2) = 1, and for n > 2, a(n) = 2*a(A252463(n)) + [n == 1 (mod 2)]*[J(3|n) == 1], where J is the Jacobi-symbol.at n=42A292253
- Prime-slideable numbers: such that a prime can be obtained by moving each digit d by d places either to the left or right, without creating a hole or overlap.at n=39A296236
- Triangle T(w>=1,1<=n<=w) read by rows: the number of rooted weighted trees with n nodes and weight w.at n=62A303911