Properties of the Number 59590

Fifty-Nine Thousand Five Hundred Ninety

Basics

Value: 59589 → 59590 → 59591

Parity: even

Prime: No

Previous Prime: 59581

Next Prime: 59611

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 × 59 × 101

Divisors: 1, 2, 5, 10, 59, 101, 118, 202, 295, 505

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 1110100011000110

Octal: 164306

Duodecimal: 2A59A

Hexadecimal: e8c6

Square: 3550968100

Square Root: 244.11063065749514

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(n) = ((1 + 7·sqrt(2))ⁿ - (1 - 7·sqrt(2))ⁿ)/(14·sqrt(2)). A125819

Number of (n+1) X (6+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250781

Number of (7+1) X (n+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250789

Numbers obtained by reinterpreting base-2 representation of n in the factorial base: a(n) = ∑_k>=0 A030308(n,k)*A000142(k+1). A59590

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250783