Properties of the Number 16064

Sixteen Thousand Sixty-Four

Basics

Value: 16063 → 16064 → 16065

Parity: even

Prime: No

Previous Prime: 16063

Next Prime: 16067

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ⁶ × 251

Divisors: 1, 2, 4, 8, 16, 32, 64, 251, 502, 1004

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111011000000

Octal: 37300

Duodecimal: 9368

Hexadecimal: 3ec0

Square: 258052096

Square Root: 126.74383614203887

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

Expansion of 1/(1 - x - x² - x⁶ + x⁸). A225391

Triangle read by rows: T(n,k) is the number of permutations of an n-set having k cycles of size > 1 (0<=k<=floor(n/2)). A136394

a(n) = ∑_k=2..n n(n-1)...(n-k+1)/k. A6231

8-step Fibonacci sequence starting with 0,0,0,0,0,0,1,0. A251672

a(n) = coefficient of xⁿ in A(x) where x = ∑_n=-oo..+oo (-1)^n-1 * xⁿ * (1 + xⁿ*A(x)ⁿ)ⁿ. A359672

The limiting sequence [A259095(r(r+1)/2-s,r), s=0,1,2,...,r-1] for very large r. A5576

A symmetrical triangle sequence: T(n, k) = q^k + q^n-k - qⁿ, with q=4. A176227

Composite n such that φ(n) * σ(n) is one less than a square. A15709

Numbers n such that φ(n) + 1 | σ(n). A56097

Numbers k such that σ(k) == 4 (mod φ(k)). A67193