Properties of the Number 27887

Twenty-Seven Thousand Eight Hundred Eighty-Seven

Basics

Value: 27886 → 27887 → 27888

Parity: odd

Prime: No

Previous Prime: 27883

Next Prime: 27893

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 79 × 353

Divisors: 1, 79, 353, 27887

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110011101111

Octal: 66357

Duodecimal: 1417B

Hexadecimal: 6cef

Square: 777684769

Square Root: 166.99401186868948

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

a(1)=0, and a(n+1) is the position of first occurrence of a(n) in the decimal expansion of 1/π. A98319

a(n) = prime(n)² - 2. A49001

A Chebyshev T-sequence with Diophantine property. A78363

Numerators of continued fraction convergents to sqrt(165). A41304

Collatz-2 (A063041) trajectory starting at 47. A280707

Starting positions of strings of three 4's in the decimal expansion of π. A83615

2·JacobiSymbol(p,5) mod p² for p=prime(n). A113651

Number of strings of numbers x(i=1..n) in 0..2 with sum i·x(i) equal to n·2. A184696

Numbers k such that p-k=p#-k#, where p=nextprime(k), k#=nextprime(square root of k), p#=nextprime(square root of p). A37210

a(1) = 2. For n>1, a(n) = smallest m such that m == 0 (mod prime(n)), m + 1 == 0 (mod prime(n+1)) and m-1 == 0 (mod prime(n-1)). A78455