Properties of the Number 2606

Two Thousand Six Hundred Six

Basics

Value: 2605 → 2606 → 2607

Parity: even

Prime: No

Previous Prime: 2593

Next Prime: 2609

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 1303

Divisors: 1, 2, 1303, 2606

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 101000101110

Octal: 5056

Duodecimal: 1612

Hexadecimal: a2e

Square: 6791236

Square Root: 51.048996072400875

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

Number of polyhedra (or 3-connected simple planar graphs) with n nodes. A944

Dispersion of A047216, (numbers >1 and congruent to 1 or 2 mod 5), by antidiagonals. A191726

T(n,k)=Number of length n+4 0..k arrays with every five consecutive terms having the maximum of some two terms equal to the minimum of the remaining three terms. A254698

a(n) = n² + (n+1)² + (n+2)² + (n+3)². A27575

T(n,k) is the number of n-bead necklaces labeled with numbers -k..k allowing reversal, with sum zero and avoiding the patterns z z+1 z+2 and z z-1 z-2. A209485

T(n,k)=Number of length n+3 0..k arrays with every four consecutive terms having the sum of some three elements equal to three times the fourth. A248537

Number of strict integer partitions of n > 0 such that the least part and the greatest part are both odd (equivalently, their product is odd). A391228

Length of n-th term in Look and Say sequences A005150 and A007651. A5341

Numbers n such that n²+n+41 (Euler's "prime generating polynomial") is not squarefree. A97823

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