Properties of the Number 36501

Thirty-Six Thousand Five Hundred One

Basics

Value: 36500 → 36501 → 36502

Parity: odd

Prime: No

Previous Prime: 36497

Next Prime: 36523

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 23 ³

Divisors: 1, 3, 23, 69, 529, 1587, 12167, 36501

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000111010010101

Octal: 107225

Duodecimal: 19159

Hexadecimal: 8e95

Square: 1332323001

Square Root: 191.05234884711572

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) = 3·n³. A117642

Numbers k such that 3 is the largest decimal digit of k². A277960

Binomial(2n, n) - 2 mod n⁴. A246134

Number T(n,k) of binary words of length n containing exactly k (possibly overlapping) occurrences of the subword 01101; triangle T(n,k), n>=0, k=0..max(0,floor((n-2)/3)), read by rows. A277751

a(0) = 1; a(n) = 2·n * a(n-1) + ∑_k=0..n-1 binomial(n,k) * a(k). A343672

Composite numbers whose exponents in their canonical factorization lie in the geometric progression 1, 3, 9, ... A102838

Number of binary words of length n containing exactly one occurrence of the subword 01101. A317780

Number of nX3 0..1 arrays with every element equal to 0, 2, 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A299556

Number of ways to choose a constant rooted partition of each part in a strict rooted partition of n. A301767

a(n) is the smallest number k in the sorted sequence S(q) = {k : rad(k) = q}, q = A120944(n), such that τ(k) - A008479(k) is not positive, where rad = A007947 and τ = A000005. A373737