8007
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 11376
- Proper Divisor Sum (Aliquot Sum)
- 3369
- 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
- 4992
- Möbius Function
- -1
- Radical
- 8007
- 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
- 44
- 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
- no
- Odd
- yes
Appears in sequences
- Numbers k such that 9*2^k - 1 is prime.at n=26A002236
- G.f.: 1/((1-x)*(1-x^2))^6.at n=8A038166
- Numbers whose base-6 representation has exactly 6 runs.at n=7A043614
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= (n-4)/2.at n=15A048060
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= (n+2)/3.at n=15A048071
- Number of nonempty subsets of {1,2,...,n} in which exactly 1/2 of the elements are <= (n+3)/3.at n=15A048082
- T(n,k)=S(2n+2,n-1,k-1), 0<=k<=n, n >= 0, array S as in A050157.at n=34A050162
- Expansion of (1+15*x+15*x^2+x^3)/(1-x)^12.at n=4A059603
- Least nontrivial multiple of the n-th prime beginning with 8.at n=36A078292
- a(n) = n^3 + 7.at n=20A084377
- Integers k such that 10^k+21 is prime.at n=12A108050
- Numbers k such that k^4 contains a pandigital substring.at n=20A115934
- a(n) = binomial(n,6)-1.at n=10A124089
- Numbers of the form 86+p^2 (where p is a prime).at n=23A138692
- a(n) = A142590(n)/3.at n=51A142883
- n such that the Moebius function take successively, from n, the values -1,0,-1,0,-1,0.at n=40A172354
- a(n) gives the number of nonisomorphic connected compact Lie groups of dimension n which are simple products.at n=48A177821
- Numbers k such that 2^(k+1) == 1 (mod k).at n=15A187787
- 7^n mod 10000.at n=40A216130
- Number of nX1 0..2 arrays with every row and column least squares fitting to a zero slope straight line, with a single point array taken as having zero slope.at n=10A223743