8750
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 18744
- Proper Divisor Sum (Aliquot Sum)
- 9994
- 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
- 3000
- Möbius Function
- 0
- Radical
- 70
- Omega Function (Ω)
- 6
- 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
- 78
- 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
- Numbers that are the sum of 6 positive 7th powers.at n=22A003373
- Number of points on surface of hexagonal prism: 12*n^2 + 2 for n > 0 (coordination sequence for W(2)).at n=27A005914
- Number of 5-leaf rooted trees with n levels.at n=13A007715
- a(0) = 1, a(n) = 27*n^2 + 2 for n>0.at n=18A010017
- sech(arcsin(x)*exp(x))=1-1/2!*x^2-6/3!*x^3-23/4!*x^4-20/5!*x^5...at n=7A012327
- sech(arctanh(x)*exp(x))=1-1/2!*x^2-6/3!*x^3-27/4!*x^4-60/5!*x^5...at n=7A012720
- A convolution triangle of numbers obtained from A036083.at n=11A030527
- Numbers k such that 37*2^k+1 is prime.at n=27A032368
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 2 skipped primes.at n=41A050769
- Numbers n such that n | 7^n + 6^n + 5^n + 4^n + 3^n + 2^n + 1^n.at n=34A056750
- McKay-Thompson series of class 22A for Monster.at n=23A058567
- Triangle of coefficients of polynomials (rising powers) useful for convolutions of A000032(n+1), n >= 0 (Lucas numbers).at n=13A061188
- At stage 1, start with a unit equilateral equiangular triangle. At each successive stage add 3*(n-1) new triangles around outside with edge-to-edge contacts. Sequence gives number of triangles (regardless of size) at n-th stage.at n=26A064412
- Numbers n such that n*phi(n-1) is a perfect square.at n=16A069069
- Numbers k such that S(k)=d(k), where S(k) is the Kempner function (A002034) and d(k) is the number of divisors of k (A000005).at n=12A073307
- Numbers n such that number of divisors of n divides S(n), the Kempner function A002034.at n=21A073413
- Least k >= 3 such that Fibonacci(k) == -1 (mod 3^n).at n=8A079003
- Sums of (one or more distinct) k-perfect numbers.at n=44A083865
- a(n) = A000094(n+4) - A006918(n).at n=29A084835
- Triangle, read by rows, of coefficients of the hyperbinomial transform.at n=40A088956