Properties of the Number 5701

Five Thousand Seven Hundred One

Basics

Value: 5700 → 5701 → 5702

Parity: odd

Prime: Yes

Previous Prime: 5693

Next Prime: 5711

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5701

Divisors: 1, 5701

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1011001000101

Octal: 13105

Duodecimal: 3371

Hexadecimal: 1645

Square: 32501401

Square Root: 75.50496672405067

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: Yes

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Primes of the form 1 + n + n² + n³ + ... + n^k, n > 1, k > 1. A85104

Primes of form k² + k + 1. A2383

a(n) = 4·n² - 10·n + 7. A54554

Honaker primes: primes P(k) such that sum of digits of P(k) equals sum of digits of k. A33548

Primes from merging of 4 successive digits in decimal expansion of sqrt(2). A198164

Lower prime of a difference of 10 between consecutive primes. A31928

Number A(n,k) of permutations of k indistinguishable copies of 1..n with every partial sum <= the same partial sum averaged over all permutations; square array A(n,k), n>=0, k>=0, read by antidiagonals. A215561

Late-growing permutations: number of permutations of 1..n with every partial sum <= the same partial sum averaged over all permutations. A147681

Values of n such that L(10) and N(10) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227448

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 4·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x - x². A367209