8807
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 8808
- 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
- 8806
- Möbius Function
- -1
- Radical
- 8807
- 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
- 78
- 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
- 1097
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Conway-Guy sequence: a(n + 1) = 2a(n) - a(n - floor( 1/2 + sqrt(2n) )).at n=15A005318
- The generalized Conway-Guy sequence w^{3}.at n=15A006757
- Primes that remain prime through 2 iterations of function f(x) = 8x + 1.at n=22A023260
- Primes that remain prime through 3 iterations of function f(x) = 8x + 1.at n=4A023291
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 93.at n=14A031591
- Number of partitions of n into parts 3k or 3k+2.at n=55A035361
- Numerators of continued fraction convergents to sqrt(139).at n=8A041254
- {e^n}-th prime, where {e^n} is closest integer to e^n, A000227.at n=7A057219
- Primes p such that x^37 = 2 has no solution mod p.at n=29A059223
- Denoting 5 consecutive primes by p, q, r, s and t, these are the values of q such that q, r and s have 10 as a primitive root, but p and t do not.at n=18A060261
- When expressed in base 2 and then interpreted in base 7, is a multiple of the original number.at n=31A062848
- Numbers k such that (-k!! + (k+1)!! - 1)/2 is prime.at n=16A076211
- Choose a(n) so that 2*3*5*13*...*a(n) - 1 is prime; a(n) is prime; and a(n) > a(n-1).at n=39A087898
- Primes which are also prime if their base 31 representation is interpreted as a base 10 number.at n=44A090715
- Primes from merging of 4 successive digits in decimal expansion of the Golden Ratio, (1+sqrt(5))/2.at n=6A103810
- Numbers n such that n+2*prime(n) is a perfect square.at n=26A104776
- Primes from merging of 4 successive digits in decimal expansion of e.at n=20A104845
- Primes from merging of 4 successive digits in decimal expansion of exp(2).at n=18A105000
- Prime numbers k such that k^2 +- (k+1) are primes.at n=25A137460
- Prime numbers k such that 8*k+1 and 8*k+3 are also primes.at n=34A139402