Properties of the Number 5559

Five Thousand Five Hundred Fifty-Nine

Basics

Value: 5558 → 5559 → 5560

Parity: odd

Prime: No

Previous Prime: 5557

Next Prime: 5563

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 17 × 109

Divisors: 1, 3, 17, 51, 109, 327, 1853, 5559

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1010110110111

Octal: 12667

Duodecimal: 3273

Hexadecimal: 15b7

Square: 30902481

Square Root: 74.55870170543476

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

Number of integer partitions of n where the parts have the same median as the distinct parts. A360245

Composite numbers k coprime to 13 such that k divides A006190(k-Kronecker(13,k)). A327653

a(1) = 3; a(n) is smallest number >= a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A33681

Values·for records of the minima of the positive distance d between the eleventh power of a positive integer·and the square of an integer y such that d = x¹¹ - y² (x <> k² and y <> k¹¹). A179794

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 or 1 and no antidiagonal sum 0 or 1 and no row sum 1 and no column sum 1. A256029

Numbers in which 5 outnumbers all other digits together. A292735

Let Py(n)=A000330(n)=n-th square pyramidal number. Consider all integer triples (i,j,k), j >= k>0, with Py(i)=Py(j)+Py(k), ordered by increasing i; sequence gives k values. A53721

a(n) = floor(binomial(n+7,7)/binomial(n+3,3)). A84628

Integers of the form 8k+7 that can be written as a sum of four distinct 'almost consecutive' squares. A243577

Integers of the form 8k + 7 that can be written as a sum of four distinct squares of the form m, m + 2, m + 3, m + 4, where m == 2 (mod 4). A243581