8893
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 28
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 8894
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 8892
- Möbius Function
- -1
- Radical
- 8893
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 1108
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Centered 12-gonal numbers, or centered dodecagonal numbers: numbers of the form 6*k*(k-1) + 1.at n=38A003154
- Primes equal to the sum of the first k primes for some k.at n=7A013918
- Greatest prime divisor of prime(n)*prime(n-1) + 1.at n=50A023525
- Least m such that if r and s in {1/3, 1/6, 1/9, ..., 1/3n} satisfy r < s, then r < k/m < (k+1)/m < s for some integer k.at n=41A024838
- Primes that are concatenations of n with n + 5.at n=9A032628
- Primes whose sum of digits is the perfect number 28.at n=20A048517
- Consider a 3 X 3 X 3 Rubik cube, but only allow the moves M_R, D; sequence gives number of positions that are exactly n moves from the start.at n=10A080617
- a(n) is the fixed point if function A008472 is iterated when started at initial value prime[n]!.at n=63A082088
- Primes p such that (r-p)/log(p) > 3, where r is the next prime after p.at n=23A082888
- Primes in A003154.at n=21A083577
- a(n) is the least prime following A002282(n) repdigits.at n=4A099662
- Sum of the first 2^n primes.at n=6A099825
- Smallest prime equal to the sum of exactly 2n+1 distinct odd primes.at n=31A100694
- prime(k) for those k where floor((2*(prime(k+1)-prime(k))*PrimePi(k) mod (8*k))/k) = m with m = 10.at n=16A109564
- Sum of first 2n primes.at n=32A109722
- Sum of the first n^2 primes.at n=8A109724
- Let q(n) = prime(1) + ... + prime(n); a(n) = smallest divisor of q(n) not already in sequence.at n=63A111267
- Records in A111267.at n=16A111268
- Numbers n such that n, n+1 and n+2 are 1,2,3-almost primes.at n=32A112998
- Primes in the sums of the first 2^n primes or primes in A099825.at n=3A113617