887
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 888
- 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
- 886
- Möbius Function
- -1
- Radical
- 887
- 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
- 54
- Smith 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
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 154
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- achthundertsiebenundachtzig· ordinal: achthundertsiebenundachtzigste
- English
- eight hundred eighty-seven· ordinal: eight hundred eighty-seventh
- Spanish
- ochocientos ochenta y siete· ordinal: 887º
- French
- huit cent quatre-vingt-sept· ordinal: huit cent quatre-vingt-septième
- Italian
- ottocentoottantasette· ordinal: 887º
- Latin
- octingenti octoginta septem· ordinal: 887.
- Portuguese
- oitocentos e oitenta e sete· ordinal: 887º
Appears in sequences
- Primes that divide at least one term in every Fibonacci sequence.at n=34A000057
- a(0)=2; for n>=1, a(n) = smallest prime p such that there is a gap of exactly 2n between p and next prime, or -1 if no such prime exists.at n=10A000230
- Primes p == 7, 19, 23 (mod 40) such that (p-1)/2 is also prime.at n=10A000353
- Irregular primes: primes p such that at least one of the numerators of the Bernoulli numbers B_2, B_4, ..., B_{p-3} (A000367) is divisible by p.at n=60A000928
- Euclid-Mullin sequence: a(1) = 2, a(n+1) is smallest prime factor of 1 + Product_{k=1..n} a(k).at n=20A000945
- Related to S(n), the number of self-dual monotone Boolean functions of n variables (A001206): 2^n-th term is S(n).at n=25A001087
- Primes with 5 as smallest primitive root.at n=22A001124
- Full reptend primes: primes with primitive root 10.at n=53A001913
- Smallest prime == 7 (mod 8) where Q(sqrt(-p)) has class number 2n+1.at n=14A002146
- Primes (lower end) with record gaps to the next consecutive prime: primes p(k) where p(k+1) - p(k) exceeds p(j+1) - p(j) for all j < k.at n=7A002386
- Increasing gaps between prime-powers.at n=10A002540
- Numbers k such that (k^2 + k + 1)/13 is prime.at n=42A002642
- Smallest number requiring n chisel strokes for its representation in Roman numerals.at n=20A002964
- Divisible only by primes congruent to 5 mod 7.at n=39A004623
- Class 4+ primes (for definition see A005105).at n=11A005108
- Class 3- primes (for definition see A005109).at n=46A005111
- Safe primes p: (p-1)/2 is also prime.at n=23A005385
- a(n) = a(n-1) + a(n - 1 - number of even terms so far).at n=24A006336
- Antichains (or order ideals) in the poset 2*2*3*n or size of the distributive lattice J(2*2*3*n).at n=2A006360
- Reverse and Add! sequence starting with 196.at n=1A006960