Properties of the Number 6604

Six Thousand Six Hundred Four

Basics

Value: 6603 → 6604 → 6605

Parity: even

Prime: No

Previous Prime: 6599

Next Prime: 6607

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 13 × 127

Divisors: 1, 2, 4, 13, 26, 52, 127, 254, 508, 1651

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1100111001100

Octal: 14714

Duodecimal: 39A4

Hexadecimal: 19cc

Square: 43612816

Square Root: 81.26499861564018

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 e.g.f. 1/(1 - x + log(1 - x)). A52820

Number of magic labelings of the prism graph I X C₇ with magic sum n. A244873

T(n,k)=Number of -k..k arrays x(0..n-1) of n elements with zeroth through n-1st differences all nonzero. A199943

Sum of the sixth largest parts of the partitions of n into 10 squarefree parts. A326632

T(n,k)=Number of nXk 0..2 arrays with top left element 0, horizontal differences mod 3 never 1, vertical differences mod 3 never -1, and antidiagonal differences never 0. A229402

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

Rectangular array read by antidiagonals: A(n,k) = number of magic labelings of the graph LOOP X C_n (see comments) having magic sum k, n >= 1, k >= 0. A293311

Number of partitions of n which contain their signature as a subpartition. A118052

Expansion of (5-12·x-9·x²+8·x³+x⁴)/(1-3·x-3·x²+4·x³+x⁴-x⁵). A189237

G.f.: exp( ∑_n>=1 A322201(n)*xⁿ/n ), where A322201(n) is the coefficient of xⁿ*yⁿ/(2·n) in ∑_n>=1 -log(1 - (xⁿ + yⁿ)). A322202