Properties of the Number 3302

Three Thousand Three Hundred Two

Basics

Value: 3301 → 3302 → 3303

Parity: even

Prime: No

Previous Prime: 3301

Next Prime: 3307

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 × 13 × 127

Divisors: 1, 2, 13, 26, 127, 254, 1651, 3302

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110011100110

Octal: 6346

Duodecimal: 1AB2

Hexadecimal: ce6

Square: 10903204

Square Root: 57.463031594234565

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

a(n)-th and (a(n)+1)-st primes are the first pair of primes that differ by exactly 2n; a(n) = -1 if no such pair of primes exists. A38664

a(n) = 2ⁿ - C(n,0) - ... - C(n,4). A2664

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 2 3 4 6 or 7 and every 3X3 column and antidiagonal sum not equal to 2 3 4 6 or 7. A252407

a(n) = ∑_k=0..7 binomial(n,k). A8860

Maximal number of pieces obtained by slicing a torus (or a bagel) with n cuts: (n³ + 3·n² + 8·n)/6 (n > 0). A3600

a(n) = n*(5·n-3). A135706

Numbers that can be written as s^x + t^y + u^z with 1 < s < t < u and {s,t,u} = {x,y,z} (the sequence of exponents can be any permutation of s,t,u). A385233

Each permutation in the list A060117 converted to Site Swap notation, with digits reversed and inverted. "Zero throws" (fixed elements) indicated with 0's. A60498

Numbers n such that digits of n are not present in n⁴. A111116

Sum of the largest parts of the partitions of n into 10 squarefree parts. A326637