Properties of the Number 72064

Seventy-Two Thousand Sixty-Four

Basics

Value: 72063 → 72064 → 72065

Parity: even

Prime: No

Previous Prime: 72053

Next Prime: 72073

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ⁷ × 563

Divisors: 1, 2, 4, 8, 16, 32, 64, 128, 563, 1126

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001100110000000

Octal: 214600

Duodecimal: 35854

Hexadecimal: 11980

Square: 5193220096

Square Root: 268.4473877690003

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

Array read by rows: T(n,k) is the number of directed multigraphs with loops with n arcs, k vertices, and no vertex of degree 0. A136564

E.g.f. A(x) satisfies A(x) = exp( 1/(1 - x/A(x)) - 1 ). A361095

Fibonacci sequence beginning 2, 16. A22370

x-values in the solution to x² - 20·y² = 176. A228207

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (Lucas numbers). A24368

3-apexes of ω: numbers k such that ω(k-3) < ω(k-2)< ω(k-1) < ω(k) > ω(k+1) > ω(k+2) > ω(k+3), where ω(m) = the number of prime factors of m, counting multiplicity. A76760

Erroneous version of A024368. A25068

A004001[n + 1]*Fibonacci[n + 1] - 2·A004001[n]*Fibonacci[n] + A004001[n - 1]*Fibonacci[n - 1]. A120472

Least k>0 such that prime(n)+k·n is prime. A72064

G.f. satisfies: A(x) = Series_Reversion[ x/sqrt(1 + 4·A(x)) ] with A(0)=0. A140092