Properties of the Number 3437

Three Thousand Four Hundred Thirty-Seven

Basics

Value: 3436 → 3437 → 3438

Parity: odd

Prime: No

Previous Prime: 3433

Next Prime: 3449

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 7 × 491

Divisors: 1, 7, 491, 3437

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 110101101101

Octal: 6555

Duodecimal: 1BA5

Hexadecimal: d6d

Square: 11812969

Square Root: 58.625932828399414

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

Expansion of ∏_m>=1 (1+x^m)^A000009(m). A50342

a(n) = T(2·n-1, n-2), where T is given by A026519. A26529

Triangle read by rows: T(n,k) is the number of k-block partitions of an n-set up to rotations. A152175

T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-1) (-1,1) or (0,-1) and new values introduced in order 0..2. A276299

Sum of gcd(x, y) for 1 <= x, y <= n. A18806

a(1) = 4; a(n) is smallest number > a(n-1) such that the juxtaposition a(1)a(2)...a(n) is a prime. A74341

a(1) = 1, a(n+1) is the sum of a(n) and floor( arithmetic mean of a(1) ... a(n) ). A65094

T(n,k)=Number of length n+3 0..k arrays with no consecutive four elements summing to more than 2·k. A241964

Triangle read by rows, 1 <= k <= n: T(n,k) = non-isomorphic colorings of a toroidal n X k grid using exactly four colors under translational symmetry and swappable colors. A294793

a(1) = 1; for n>1, a(n) = least k such that concatenation of n copies of k with all previous concatenations gives a prime. A111471