Properties of the Number 34069

Thirty-Four Thousand Sixty-Nine

Basics

Value: 34068 → 34069 → 34070

Parity: odd

Prime: No

Previous Prime: 34061

Next Prime: 34123

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 7 × 31 × 157

Divisors: 1, 7, 31, 157, 217, 1099, 4867, 34069

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1000010100010101

Octal: 102425

Duodecimal: 17871

Hexadecimal: 8515

Square: 1160696761

Square Root: 184.5778968349136

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

Engel expansion of log(π) = 1.14473... . A59195

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

a(n) = the number of cubes (of integers > 0) that have bit length n. A365932

Partial sums of A058129. A118601

Number of (n+1)X(7+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250728

Number of (6+1)X(n+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250735

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing x(i,j)+x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250729

Decimal part of a(n)^1/4 starts with n so that a(n)<a(n+1). A34069