Properties of the Number 34086

Thirty-Four Thousand Eighty-Six

Basics

Value: 34085 → 34086 → 34087

Parity: even

Prime: No

Previous Prime: 34061

Next Prime: 34123

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 13 × 19 × 23

Divisors: 1, 2, 3, 6, 13, 19, 23, 26, 38, 39

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000010100100110

Octal: 102446

Duodecimal: 17886

Hexadecimal: 8526

Square: 1161855396

Square Root: 184.62394210935915

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

G.f.: 1/p(x), where p(x) = degree 22 Salem polynomial p(x) = x²² + x²¹ - x¹⁹ - 2·x¹⁸ - 3·x¹⁷ - 3·x¹⁶ - 2·x¹⁵ + 2·x¹³ + 4·x¹² + 5·x¹¹ + 4·x¹⁰ + 2·x⁹ - 2·x⁷ - 3·x⁶ - 3·x⁵ - 2·x⁴ - x³ + x + 1. A143419

Positive integers m such that π(m³) = π(j³) + π(k³) for some 0 < j <= k < m. A262409

T(n,k) = Number of n X k 0..1 arrays with each 1 adjacent to 1, 2 or 4 king-move neighboring 1's. A296739

4-dimensional analog of centered polygonal numbers. A6323

Expansion of (1+2·x)/((1+x)*(1-x²-x³)). A98601

Positive integers k having no duplicated digit such that concatenating all successive absolute differences between two successive digits of k produces a divisor of k. A338641

Number of nX4 0..1 arrays with each 1 adjacent to 1, 2 or 4 king-move neighboring 1s. A296735

Number of n X 5 0..1 arrays with each 1 adjacent to 1, 2 or 4 king-move neighboring 1's. A296736

G.f. A(x) satisfies: 0 = ∑_n=-oo..+oo x^n² * (xⁿ - A(x))ⁿ⁺¹. A355863

Irregular table read by rows: Take a Reuleaux triangle with all diagonals drawn, as in A340639. Then T(n,k) = number of k-sided polygons in that figure for k >= 3. A340614