Properties of the Number 34008

Thirty-Four Thousand Eight

Basics

Value: 34007 → 34008 → 34009

Parity: even

Prime: No

Previous Prime: 33997

Next Prime: 34019

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 13 × 109

Divisors: 1, 2, 3, 4, 6, 8, 12, 13, 24, 26

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000010011011000

Octal: 102330

Duodecimal: 17820

Hexadecimal: 84d8

Square: 1156544064

Square Root: 184.4125809157282

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

Table read by antidiagonals: T(h,n) is the number of n-step self avoiding walks on a 3D cubic lattice confined inside a box of size 2h X 2h X 2h where the walk starts at the center of the box. A337023

Numbers k such that 6^k - 5^k - 4^k - 3^k - 2^k - 1 is prime. A240507

Solution of the complementary equation a(n) = 3·a(n-2) + b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences. A295138

Number of complementary pairs of circulant digraphs on n nodes. A54930

Coefficient of y⁰ in G(x,y)⁴ where G(x,y) = ∑_n=-oo..+oo (1-xⁿ)ⁿ * xⁿ * yⁿ. A263189

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

a(n) = floor(2^|n-1|/2). Or: 1, 0, followed by powers of 2. A34008

Least d > 0 such that both Q = M + 2d and R = M + (M²-1)/(Q-M) are prime, where M = 2ⁿ - 1 = A000225(n), or 0 if there is no such d. A320875