8892
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 27
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 25480
- Proper Divisor Sum (Aliquot Sum)
- 16588
- 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
- 2592
- Möbius Function
- 0
- Radical
- 1482
- Omega Function (Ω)
- 6
- 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
- 184
- 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
- The smaller of a betrothed pair.at n=6A003502
- Betrothed (or quasi-amicable) numbers.at n=12A005276
- 11-gonal (or hendecagonal) pyramidal numbers: a(n) = n*(n+1)*(3*n-2)/2.at n=18A007586
- a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ... + a(n-3)*a(3) for n >= 4, with initial terms 2, -2, 1, 2.at n=16A025260
- Numbers k such that k*2^k - (k-1) is prime.at n=17A046847
- 12 times triangular numbers.at n=38A049598
- a(n) = Sum_{d|n, d==1 mod 4} d^3 - Sum_{d|n, d==3 mod 4} d^3.at n=20A050459
- a(n) = Sum_{d|n, d==1 mod 4} d^3 - Sum_{d|n, d==3 mod 4} d^3.at n=41A050459
- a(n) = Sum_{d|n, n/d=1 mod 4} d^3 - Sum_{d|n, n/d=3 mod 4} d^3.at n=20A050471
- Jordan function J_3(n).at n=20A059376
- Numbers k such that sigma(x) = k has exactly 10 solutions.at n=12A060666
- Numbers k such that phi(x) = k has exactly 9 solutions.at n=43A060672
- Multiplicative with a(p^e) = 1 - p^3.at n=20A063453
- Numbers k such that phi(k) = 2*tau(k)^2.at n=17A068564
- Local maxima of A053707 (first differences of A025475, powers of a prime but not prime).at n=46A088365
- Start with 1 and repeatedly reverse the digits and add 35 to get the next term.at n=37A118632
- Twice nonagonal numbers (or twice 9-gonal numbers): a(n) = n*(7*n-5).at n=36A139268
- a(n) = p(n)*p(n+2)-p(n+1), where p(n) is the n-th prime.at n=23A152530
- Record gaps between nonprime prime powers.at n=23A167186
- Triangle T(n, k) = round( c(n)/(c(k)*c(n-k)) ), where c(n) = Product_{j=1..n} A078012(j+3), read by rows.at n=60A172356