Properties of the Number 36864

Thirty-Six Thousand Eight Hundred Sixty-Four

Basics

Value: 36863 → 36864 → 36865

Parity: even

Prime: No

Previous Prime: 36857

Next Prime: 36871

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ¹² × 3 ²

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18

Polygonal

Triangular: No

Square: Yes

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001000000000000

Octal: 110000

Duodecimal: 19400

Hexadecimal: 9000

Square: 1358954496

Square Root: 192

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: Yes

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

Smallest number with exactly n divisors. A5179

Expansion of g.f.: (1+x)/(1-8·x). A3951

The minimal numbers: sequence A005179 arranged in increasing order. A7416

a(n) = n*(n-1)*2ⁿ. A128796

a(n) = 9·2ⁿ. A5010

a(n) = solution to the "Select All, Copy, Paste" problem: Given the ability to type a single letter, or to type individual "Select All", "Copy" or "Paste" command keystrokes, what is the maximal number of letters of text that can be obtained with n keystrokes? A178715

First differences of A045623. A45891

14-almost primes (generalization of semiprimes). A69275

Triangle read by rows: coefficients T(n,k) of a binomial decomposition of n as ∑_k=0..n T(n,k)*binomial(n,k). A244130

Triangle read by rows: coefficients T(n,k) of a binomial decomposition of n*(n-1) as Sum(k=0..n)T(n,k)*binomial(n,k). A244138