Properties of the Number 5707

Five Thousand Seven Hundred Seven

Basics

Value: 5706 → 5707 → 5708

Parity: odd

Prime: No

Previous Prime: 5701

Next Prime: 5711

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 13 × 439

Divisors: 1, 13, 439, 5707

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1011001001011

Octal: 13113

Duodecimal: 3377

Hexadecimal: 164b

Square: 32569849

Square Root: 75.54468876102409

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(0)=0, a(1)=1, a(2)=1, a(3)=1, a(n) = a(n-3) + a(n-4) for n > 3. A79398

Compound filter: a(n) = T(A032742(n), A046523(n)), where T(n,k) is sequence A000027 used as a pairing function. A285729

Maximum number of regions defined by n zigzag-lines in the plane when a zigzag-line is defined as consisting of two parallel infinite half-lines joined by a straight line segment. A117625

Floor(ζ(3)ⁿ). A125890

Compound filter: a(n) = P(A278222(n), A278222(1+n)), where P(n,k) is sequence A000027 used as a pairing function. A286240

Antidiagonal sums of square array A082011. A82014

Expansion of (1+t³)²/((1-t)*(1-t²)²*(1-t⁴)). A106607

Compound filter (multiplicative order of 2 mod 2n+1 & eulerphi(2n+1)): a(n) = P(A002326(n), A037225(n)), where P(n,k) is sequence A000027 used as a pairing function. A291755

Expansion of 1/((1 - x - x⁴)² - 4·x⁵). A375283

Numbers each of whose runs of digits in base 12 has length 2. A33010