Properties of the Number 5640

Five Thousand Six Hundred Forty

Basics

Value: 5639 → 5640 → 5641

Parity: even

Prime: No

Previous Prime: 5639

Next Prime: 5641

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 5 × 47

Divisors: 1, 2, 3, 4, 5, 6, 8, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1011000001000

Octal: 13010

Duodecimal: 3320

Hexadecimal: 1608

Square: 31809600

Square Root: 75.09993342207434

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

Numbers k such that (11·10^k + 19)/3 is prime. A270339

5 times triangular numbers: a(n) = 5·n*(n+1)/2. A28895

Number of edges formed by sides and straight "chords" in a right triangle when each side is divided by vertices into n equal segments. A274586

Numbers that can be expressed as the difference of the squares of primes in just three distinct ways. A90782

Consider the Diophantine equation x³ + y³ = z³ + 1 (1 < x < y < z) or 'Fermat near misses'. Sequence gives values of z in monotonic increasing order. A50791

T(n,k)=Number of length n+4 0..k arrays with no disjoint pairs in any consecutive five terms having the same sum. A247404

Numbers k such that φ(x) = k has exactly 11 solutions. A60674

Numbers of the form p³*q·r*s where p, q, r, and s are distinct primes. A179670

T(n,k)=Number of length-n 0..k arrays with no repeated value unequal to the previous repeated value plus one mod k+1. A268944

T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by other than plus two or minus 1. A269640