Properties of the Number 3490

Three Thousand Four Hundred Ninety

Basics

Value: 3489 → 3490 → 3491

Parity: even

Prime: No

Previous Prime: 3469

Next Prime: 3491

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 349

Divisors: 1, 2, 5, 10, 349, 698, 1745, 3490

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110110100010

Octal: 6642

Duodecimal: 202A

Hexadecimal: da2

Square: 12180100

Square Root: 59.07622195096772

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

G.f. satisfies: A(x) = 1 + x/A(-x·A(x)⁴)². A213094

Antichains (or order ideals) in the poset 2·2*2·n or size of the distributive lattice J(2·2*2·n). A56932

a(n)=a(n-1)+a(m), where m=2n-2-2^p+1 and 2^p<n-1<=2^p+1, for n >= 4. A50063

The binary encoding (as a rooted planar tree) of each rooted planar binary tree. See A057123 for illustration. A57122

T(n,k) = Number of (n+1) X (k+1) 0..1 arrays with the permanents of 2X2 subblocks nondecreasing rightwards and downwards. A204723

Antichains (or order ideals) in the poset 2·2*4·n or size of the distributive lattice J(2·2*4·n). A6361

T(n,k) is the number of (n+1) X (k+1) 0..1 arrays with rows and columns of permanents of all 2 X 2 subblocks lexicographically nondecreasing. A204962

a(n) = PrimePi(n³) - PrimePi(n)³, where PrimePi = A000720. A291538

T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3, 4, 5 or 6 king-move adjacent elements, with upper left element zero. A298461

Number of partitions of n into 10 distinct squarefree parts. A341098