Properties of the Number 34937

Thirty-Four Thousand Nine Hundred Thirty-Seven

Basics

Value: 34936 → 34937 → 34938

Parity: odd

Prime: No

Previous Prime: 34919

Next Prime: 34939

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 7 ² × 23 × 31

Divisors: 1, 7, 23, 31, 49, 161, 217, 713, 1127, 1519

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000100001111001

Octal: 104171

Duodecimal: 18275

Hexadecimal: 8879

Square: 1220593969

Square Root: 186.91441891946164

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

Hexagonal prism numbers: a(n) = (n + 1)*(3·n² + 3·n + 1). A5915

Coefficients in the expansion of C³/B⁴, in Watson's notation of page 118. A160527

G.f. A(x) satisfies 0 = A(0) and 0 = f(x, A(x)) where f(u, v) = (u - v) * (1 + u·v) - u·v * (1 - u·v). A245735

a(1) = 1; a(n+1) = round(sqrt(3)*a(n)). A134009

Nonnegative values·of solutions (x, y) to the Diophantine equation x² + (x+84847)² = y². A201917

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

G.f. F₁(x) satisfies: x = ∑_n>=1 F_n(x)ⁿ, where the n-th iteration of the g.f. is defined by: F_n(x) = F_n-1( F₁(x) ) with F₀(x) = x. A171780

Primes p of the form 6k-1 such that 2·p + 3 is prime. A34937

Irregular table of conjectural numbers. Let len(n) be the length (including n) of the Collatz (3x+1) iteration of n. The number n is in row n - len(n). A228060