8010
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 21060
- Proper Divisor Sum (Aliquot Sum)
- 13050
- 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
- 2112
- Möbius Function
- 0
- Radical
- 2670
- 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
- yes
Recreational
- Happy Number
- no
- Harshad Number
- yes
- Narcissistic Number
- no
- Collatz Steps
- 145
- 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 partitions into non-integral powers.at n=19A000158
- a(n) = 2*n*(2*n-1).at n=45A002939
- a(n) = (-1 + prime(n+1)^2)/4.at n=39A024701
- Sums of five consecutive squares: a(n) = n^2 + (n+1)^2 + (n+2)^2 + (n+3)^2 + (n+4)^2.at n=38A027578
- Product of a prime and the following number.at n=23A036690
- Positive numbers having the same set of digits in base 9 and base 10.at n=30A037443
- Numerators of continued fraction convergents to sqrt(424).at n=8A041806
- Numbers whose base-6 representation has exactly 6 runs.at n=10A043614
- a(n) = Fibonacci(n)*(Fibonacci(n) + 1).at n=11A059727
- Numbers k such that the largest prime power factor of k equals floor(sqrt(k)).at n=37A081807
- Quotient of LCM of prime(n+1)-1 and prime(n)-1 and GCD of the same two numbers.at n=40A083555
- Number of lattice points on or inside the rectangle formed by [1 <= x <= (q-1)/2] and [1 <= y <= (p-1)/2], where p = n-th prime, q = (n-1)-st prime.at n=39A087427
- Numbers k such that if P = 10*k^2+1, then P, P+6, P+12 and P+18 are all primes.at n=26A092446
- a(n+1) = least positive integer not already used that begins with the last two digits of a(n).at n=39A098753
- Take the n-th pair of consecutive digits of the sequence and form their absolute difference; the result is the n-th digit of the sequence; a(n) < a(n+1).at n=14A102694
- a(n) is a non-palindromic composite located between twin primes whose reverse, which is less than it, is also located between twin primes.at n=9A103741
- a(n) =(A001359[n]^2-1)/2.at n=12A117849
- Engel expansion of cosh(1).at n=45A118239
- a(n) = 8*n^3 + n.at n=10A118465
- a(n) = number of conjugacy classes in PSL_3(prime(n)).at n=23A124679