Properties of the Number 64514

Sixty-Four Thousand Five Hundred Fourteen

Basics

Value: 64513 → 64514 → 64515

Parity: even

Prime: No

Previous Prime: 64513

Next Prime: 64553

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 32257

Divisors: 1, 2, 32257, 64514

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111110000000010

Octal: 176002

Duodecimal: 31402

Hexadecimal: fc02

Square: 4162056196

Square Root: 253.99606296161363

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

Numbers such that floor(a(n)² / 7) is a square. A204516

For each row n in array A374602(n, k), the asymptotic geometric growth factor of every A377290(n) terms, represented by its nearest integer. A377291

a(n) = 16a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 16. A90727

Number of winning paths of length n+1 across an n X n Hex board. A96367

Numbers k such that s(k) = s(k+1) but φ(k) ≠ φ(k+1), where s(k) = φ(k) + φ(φ(k)) + ... + 1 is the sum of iterated φ (A092693). A291177

Number of nX4 0..1 arrays with every element unequal to 2, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A317867

A triangular sequence: T(n,m) = t1(n,m) + t1(n,n-m) where t1(n,m) = -∑_j=0..m+1 (-1)^j * t0(n + 2, j) * (m - j + 1)^{n + 1} and t0(n,m) = ∑_j=0..m+1 (-1)^j * binomial(n + 2, j) * (m - j + 1)^{n + 1}. A154869

a(n) = n⁴ + 8·n³ + 20·n² + 16·n + 2. A304725

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 2, 3 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A317871

Write A064476(n) = 2ⁱ(n)*3^j(n); sequence gives values of i(n). A64514