8052
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
- 24
- Divisor Sum
- 20832
- Proper Divisor Sum (Aliquot Sum)
- 12780
- 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
- 2400
- Möbius Function
- 0
- Radical
- 4026
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 70
- 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
- sigma_5(n), the sum of the 5th powers of the divisors of n.at n=5A001160
- a(n) = 1 + Sum_{i=1..n} (n-i+1)*phi(i).at n=42A005598
- Number of primitive (aperiodic, or Lyndon) asymmetric rhythm cycles: ones having no nontrivial shift automorphism.at n=10A006575
- Mu-molecules in Mandelbrot set whose seeds have period n.at n=13A006876
- Coordination sequence for 4-dimensional primitive di-isohexagonal orthogonal lattice.at n=11A008530
- Base-9 Armstrong or narcissistic numbers (written in base 10).at n=15A010353
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 5, with initial values 0,0,1,1.at n=24A025277
- Sum of n-th powers of divisors of 6.at n=5A034488
- Sum of fifth powers of unitary divisors.at n=5A034679
- a(n) = C(n)*(10*n + 1) where C(n) = Catalan numbers (A000108).at n=6A050489
- Partial sums of A050405.at n=6A052206
- Numbers k such that k | sigma_5(k).at n=42A055709
- Least k such that k*11^n +/- 1 are twin primes.at n=35A064220
- Convolution of Fibonacci F(n+1), n>=0, with F(n+6), n>=0.at n=10A067334
- a(n) = n*(n+1)*(n^2+1)/2.at n=11A071237
- Pair the natural numbers such that the n-th pair is (k, k+p(n)) where k is the smallest number not occurring earlier and p(n) is the n-th prime. (1, 3), (2, 5), (4, 9), (6, 13), (7, 18), (8, 21), (10, 27), (11, 30), (12, 35), (14, 43), ... This is the sequence of the product of the members of every pair.at n=33A075316
- Smallest a(n) > a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, with a(1)=5.at n=24A076671
- Smallest a(n)>a(n-1) such that a(n)^2+a(n-1)^2 is a perfect square, a(1)=9.at n=24A076674
- Sum of (n-1)-th powers of divisors of n.at n=5A082245
- Triangular array, read by rows: T(n,k) = Sum_{d|n} d^k, 0 <= k < n.at n=20A082771