Properties of the Number 3488

Three Thousand Four Hundred Eighty-Eight

Basics

Value: 3487 → 3488 → 3489

Parity: even

Prime: No

Previous Prime: 3469

Next Prime: 3491

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ⁵ × 109

Divisors: 1, 2, 4, 8, 16, 32, 109, 218, 436, 872

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110110100000

Octal: 6640

Duodecimal: 2028

Hexadecimal: da0

Square: 12166144

Square Root: 59.0592922409336

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

Numbers n such that Bernoulli number B_n has denominator 510. A271634

a(n) = 2·n² + 3·n + 3. A33816

Triangle read by rows: T(n,k) = number of edges in a "frame" of size n X k (see Comments in A331457 for definition). A332600

Product of the 5th power of a prime (A050997) and a different prime (p⁵*q). A178740

Expansion of 1/∑_k>=0 x^k². A317665

Triangle read by rows. The definition is by diagonals. The r-th diagonal from the right, for r >= 0, is given by b(0) = b(1) = 1; b(n+1) = ∑_k=0..n binomial(n+2,k+r)*a(k). A121207

Number of integer partitions of n with all equal lengths of maximal gapless runs (decreasing by 0 or 1). A384887

Composites whose prime factorization in base 3 is an anagram of the number in base 3. A260047

a(n) = 2·n*(7·n - 3). A316466

Triangle read by rows: T(n,k) is the number of set partitions of {1,2,...,n} in which the size of the last block is k, 1<=k<=n; the blocks are ordered with increasing least elements. A124496