Properties of the Number 3309

Three Thousand Three Hundred Nine

Basics

Value: 3308 → 3309 → 3310

Parity: odd

Prime: No

Previous Prime: 3307

Next Prime: 3313

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 1103

Divisors: 1, 3, 1103, 3309

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110011101101

Octal: 6355

Duodecimal: 1AB9

Hexadecimal: ced

Square: 10949481

Square Root: 57.52390807307862

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 ways to break {1,2,3,...,n} into sets with equal sums. A35470

Partial sums of A299289. A299290

Partial sums of A001158: ∑_j=1..n sigma₃(j). A64603

Composite and every divisor (except 1) contains the digit 3. A62668

a(n) = least k such that the remainder when 31^k is divided by k is n. A128371

Number of connected graphs with n edges with loops allowed. A191970

T(n,k)=Number of nXk 0..3 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors. A231839

Numbers that contain the product of any two adjacent digits as a substring, and have at least one pair of adjacent digits > 1. A203566

a(n) = a(n-1) + a(m) for n >= 4, where m = 2^p+1 + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 3, and a(3) = 2. A50061

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with all 2X2 subblock sums the same. A184003