Properties of the Number 34934

Thirty-Four Thousand Nine Hundred Thirty-Four

Basics

Value: 34933 → 34934 → 34935

Parity: even

Prime: No

Previous Prime: 34919

Next Prime: 34939

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 17467

Divisors: 1, 2, 17467, 34934

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000100001110110

Octal: 104166

Duodecimal: 18272

Hexadecimal: 8876

Square: 1220384356

Square Root: 186.9063936841113

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

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum 3 or 6 and every diagonal and antidiagonal sum not 3 or 6. A251779

a(1) = 1; a(n+1) = ∑_k=1..n lcm(a(k),a(n))/a(n). A287006

Number of primes less than 10ⁿ with digits in nonincreasing order. A345326

Triangle read by rows: T(n,k) is the number of skew Dyck paths of semilength n having k UU's starting at level 0 (i.e., doublerises at level 1; n >= 0, 0 <= k <= floor(n/2)). A129168

Semiprimes that are the sum of 10 consecutive primes. A185347

Number of (n+2) X (2+2) 0..3 arrays with every 3 X 3 subblock row and column sum 3 or 6 and every diagonal and antidiagonal sum not 3 or 6. A251773

Number of (n+2)X(4+2) 0..3 arrays with every 3X3 subblock row and column sum 3 or 6 and every diagonal and antidiagonal sum not 3 or 6. A251775

a(n) = a(n-1) + 3·a(n-2) -2·a(n-3) - 2·a(n-4), where a(0) = -2, a(1) = 0, a(2) = 0, a(3) = 1. A295858

a(1)=1, a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n*(n+1)/2 the n-th triangular number. A71184

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, 0, -1), (0, -1, 1), (0, 1, 0), (1, 1, -1)}. A148137