Properties of the Number 34690

Thirty-Four Thousand Six Hundred Ninety

Basics

Value: 34689 → 34690 → 34691

Parity: even

Prime: No

Previous Prime: 34687

Next Prime: 34693

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 × 3469

Divisors: 1, 2, 5, 10, 3469, 6938, 17345, 34690

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000011110000010

Octal: 103602

Duodecimal: 180AA

Hexadecimal: 8782

Square: 1203396100

Square Root: 186.25251676151922

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

Self-convolution of Fibonacci numbers. A1629

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 2 + 3·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 2·x - x². A367297

Triangle of coefficients of (1 - x)ⁿ*U(n,-(3·x - 2)/(2·x - 2)), where U(n,x) is the n-th Chebyshev polynomial of the second kind. A123027

Number of immersions of the oriented circle into the oriented plane with n double points and index n-1. A8984

Number of n X 2 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A281199

Triangle read by rows: row n gives coefficients of expansion of q-reduced tangent number d_n(q) in powers of q. A143195

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

Sum of digits of all the divisors of n. A34690

T(n,k)=Number of nXk 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A281205