Properties of the Number 36540

Thirty-Six Thousand Five Hundred Forty

Basics

Value: 36539 → 36540 → 36541

Parity: even

Prime: No

Previous Prime: 36529

Next Prime: 36541

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 5 × 7 × 29

Divisors: 1, 2, 3, 4, 5, 6, 7, 9, 10, 12

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000111010111100

Octal: 107274

Duodecimal: 19190

Hexadecimal: 8ebc

Square: 1335171600

Square Root: 191.1543878648879

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

Least common multiple of {d-1: d > 1 and d divides n}. A84190

Triangle of numbers obtained from the partition array A134279. A134280

Denominator of the asymptotic mean over the positive integers of the maximum exponent in the prime factorization of the largest prime(n)-smooth divisor function. A375539

Number of permutations of 3 indistinguishable copies of 1..n arranged in a circle with exactly 2 adjacent element pairs in decreasing order. A151590

a(n) is the number of convex pentagons in an n-triangular net. A176646

Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k edges; n >= 0, 0 <= k <= A002620(n). A228890

Number of ordered ways of writing n² as a sum of n nonnegative cubes. A298936

Number of digraphs on n unlabeled nodes whose strongly connected components are directed cycles or single vertices. A361584

a(n) = floor(n(n-1)(n-2)(n-3)/18). A11928

A049031/2. A49032