Properties of the Number 36309

Thirty-Six Thousand Three Hundred Nine

Basics

Value: 36308 → 36309 → 36310

Parity: odd

Prime: No

Previous Prime: 36307

Next Prime: 36313

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 ² × 13 × 19

Divisors: 1, 3, 7, 13, 19, 21, 39, 49, 57, 91

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000110111010101

Octal: 106725

Duodecimal: 19019

Hexadecimal: 8dd5

Square: 1318343481

Square Root: 190.5492062434268

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

Triangle read by rows: T(n,k) is the number of binary rooted trees with n leaves of exactly k colors and all non-leaf nodes having out-degree 2. A319541

a(n) is the smallest number that has exactly n odious divisors (A000069). A355968

Coefficient array for orthogonal polynomials p(n,x)=(x-(2n-1))*p(n-1,x)-(2n-2)²*p(n-2,x), p(0,x)=1,p(1,x)=x-1. A182826

Vandermonde sequence using x² + xy + y² applied to the first n primes. A203703

a(n) = 49*(n-1)*(n-2)/2. A27469

Number of rooted binary leaf-multilabeled trees with n leaves on the label set [3]. A220820

Number of n X 3 0..1 arrays with every element equal to 2, 3, 6 or 7 king-move adjacent elements, with upper left element zero. A298141

Number of unlabeled loopless multigraphs with n edges covering four vertices. A328652

Number of n-node planar graphs with minimum degree at least 5. A49373

Multiples of 1729, the Hardy-Ramanujan number. A138129