Properties of the Number 12064

Twelve Thousand Sixty-Four

Basics

Value: 12063 → 12064 → 12065

Parity: even

Prime: No

Previous Prime: 12049

Next Prime: 12071

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ⁵ × 13 × 29

Divisors: 1, 2, 4, 8, 13, 16, 26, 29, 32, 52

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10111100100000

Octal: 27440

Duodecimal: 6B94

Hexadecimal: 2f20

Square: 145540096

Square Root: 109.83624174196785

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

Half the number of 3 X n binary arrays with no path of adjacent 1's or adjacent 0's from top row to bottom row. A69429

In the interior of a regular 2n-gon with all diagonals drawn, the number of points where exactly three diagonals intersect. A101363

Inverse Moebius transform of the shifted tetrahedral numbers. A116963

T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its king-move neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A281139

a(n) = Fibonacci(n)*A034896(n) for n >= 1, with a(0)=1, where A034896 lists the number of solutions to a² + b² + 3·c² + 3·d² = n. A205971

Fibonacci sequence beginning 0, 32. A22366

Number of non-isomorphic abstract almost-equidistant graphs on n vertices in R⁶. A graph G is abstract almost-equidistant in R⁶ if the complement of G does not contain K₃ and G does not contain K₈ nor K_1,3,3,3. A296418

Expansion of ∑_k>0 (1/(1+x^k)⁴ - 1). A363631

Low-temperature series in exp(4J/kT) for antiferromagnetic susceptibility for the Ising model on square lattice. A2979

Let n = a_1a_2...a_k, where the a_i are digits. a(n) = least multiple of n of the type b_1a_1b_2a_2...a_kb_k+1, obtained by inserting single digits b_i in the gaps and both ends; 0 if no such number exists. A110735