Properties of the Number 3370

Three Thousand Three Hundred Seventy

Basics

Value: 3369 → 3370 → 3371

Parity: even

Prime: No

Previous Prime: 3361

Next Prime: 3371

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 × 337

Divisors: 1, 2, 5, 10, 337, 674, 1685, 3370

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110100101010

Octal: 6452

Duodecimal: 1B4A

Hexadecimal: d2a

Square: 11356900

Square Root: 58.05170109479997

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 that are the sum of 4 positive 5th powers. A3349

Number of partitions of n into parts >= 4. A8484

Expansion of 1/((1-x)²*∏_k>=1 (1-x^k)). A14153

Number of partitions of n in which the least part is 4. A26797

Number of partitions of n into distinct double-free parts. A120641

Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) is the number of k-element subsets that can be chosen from {1,2,...,k·n} having element sum k*(k·n+1)/2. A204459

Numbers k giving rise to prime quadruples (30k+11, 30k+13, 30k+17, 30k+19). A14561

T(n,k) is the number of strictly increasing arrangements of n numbers in -(n+k-2)..(n+k-2) with sum zero. A188181

Triangle T(n,k) (0 <= k <= n) read by rows: top entry is 1, all other rows begin with 0; typical entry is sum of entry to left plus sum of all entries above it in the triangle. A59226

Triangular array generated by its row sums: T(n,0) = 1 for n >= 0, T(n,1) = r(n-1), T(n,k) = T(n,k-1) - (-1)^k * r(n-k) for k = 2, 3, ..., n, n >= 2, r(h) = sum of the numbers in row h of T. A54090