Properties of the Number 36590

Thirty-Six Thousand Five Hundred Ninety

Basics

Value: 36589 → 36590 → 36591

Parity: even

Prime: No

Previous Prime: 36587

Next Prime: 36599

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 × 3659

Divisors: 1, 2, 5, 10, 3659, 7318, 18295, 36590

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000111011101110

Octal: 107356

Duodecimal: 19212

Hexadecimal: 8eee

Square: 1338828100

Square Root: 191.28512749296533

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

T(n,k)=Number of nXk 0..4 arrays with each element·equal to the number of its horizontal and vertical neighbors equal to 4,0,2,1,3 for x=0,1,2,3,4. A196718

Number of n-celled polyominoes which are of square type. A259088

Number of nX4 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 4,0,2,1,3 for x=0,1,2,3,4. A196714

Number of nX6 0..4 arrays with each element·equal to the number its horizontal and vertical neighbors equal to 4,0,2,1,3 for x=0,1,2,3,4. A196716

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (-1, 1, -1), (1, 0, 1), (1, 1, -1)}. A148654

Rectangular array read by antidiagonals. T(n,k) is the number of length k walks from {} to [n] in the digraph representation of the superset/subset relation on P([n]) the powerset of [n], n>=0, k>=0. A336703

Number of binary rooted trees with n nodes and height at most 7. A36590