Properties of the Number 3082

Three Thousand Eighty-Two

Basics

Value: 3081 → 3082 → 3083

Parity: even

Prime: No

Previous Prime: 3079

Next Prime: 3083

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 × 23 × 67

Divisors: 1, 2, 23, 46, 67, 134, 1541, 3082

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110000001010

Octal: 6012

Duodecimal: 194A

Hexadecimal: c0a

Square: 9498724

Square Root: 55.51576352712804

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) = 1 + n + 2·n². A84849

Number of partitions of n which represent first player winning Chomp positions with unique winning moves. A112472

Number of partitions of n in which each part, with the possible exception of the largest, occurs at least twice. A116931

a(n) = (9·n² + 3·n + 2)/2. A38764

Number of subsets of {1..n} with elements disjoint from first differences of elements. A364463

Numbers k such that for any positive integers (a, b), if a·b = k then a + b is prime. A80715

a(n) = n*(n+21). A132763

Number of permutations in S_n avoiding 5234{bar 1} (i.e., every occurrence of 5234 is contained in an occurrence of a 52341). A137546

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

T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 1 or 3 neighboring 1s. A297607