Properties of the Number 69664

Sixty-Nine Thousand Six Hundred Sixty-Four

Basics

Value: 69663 → 69664 → 69665

Parity: even

Prime: No

Previous Prime: 69661

Next Prime: 69677

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 2 ⁵ × 7 × 311

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 32, 56

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10001000000100000

Octal: 210040

Duodecimal: 34394

Hexadecimal: 11020

Square: 4853072896

Square Root: 263.93938698117796

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 n such that σ(n)=σ(d₁)*σ(d₂)*...*σ(d_k) where d₁ d₂ ... d_k is the decimal expansion of n. A98771

Let A denote the sequence; then A is equal to the union of the self-convolutions A² and A⁴, with terms in ascending order by size, where a(0)=1. A90847

Triangle of coefficients of di-Boustrophedon transform (see A063179) read by rows: Let the original sequence be (U0,U1,...) and the transformed sequence (V0,V2,...), then Vn is a linear combination of U0,...,Un. T(n,m) is the coefficient that goes with Um to get Vn. A63415

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (0, 1, 0), (1, -1, 1), (1, 1, -1)}. A148434

E.g.f.: A(x) = exp( ∑_n>=1 σ(n) * a(n-1)*xⁿ/n! ) = ∑_n>=0 a(n)*xⁿ/n! with a(0)=1. A156306

Largest n-digit prime with minimum digit sum. A69664