Properties of the Number 69052

Sixty-Nine Thousand Fifty-Two

Basics

Value: 69051 → 69052 → 69053

Parity: even

Prime: No

Previous Prime: 69031

Next Prime: 69061

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 61 × 283

Divisors: 1, 2, 4, 61, 122, 244, 283, 566, 1132, 17263

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10000110110111100

Octal: 206674

Duodecimal: 33B64

Hexadecimal: 10dbc

Square: 4768178704

Square Root: 262.7774723982252

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 ∏_k>=1 1/(1 - x^k)^p(k-p(k-1)), where p(k) = number of partitions of k (A000041). A304967

Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x² + ... + xⁿ to the polynomial A_k*(x+(-1)^k)^k for 0 <= k <= n. A248975

a(n) = 54·n² - 26·n + 4 (n>=1). A304381

Number of ways to dissect a square into n squares. A221842

Number of length 4+3 0..n arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms. A249710

Self-composition of binary encoding of GF(2) polynomial. A193145

T(n,k)=Number of length n+3 0..k arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms. A249707

Denominator of ∑_{i = 1..n} 1/i⁵. A69052