Properties of the Number 2802

Two Thousand Eight Hundred Two

Basics

Value: 2801 → 2802 → 2803

Parity: even

Prime: No

Previous Prime: 2801

Next Prime: 2803

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 467

Divisors: 1, 2, 3, 6, 467, 934, 1401, 2802

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 101011110010

Octal: 5362

Duodecimal: 1756

Hexadecimal: af2

Square: 7851204

Square Root: 52.933921071464184

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

Numbers n such that the decimal expansions of both n and n² have 0 as smallest digit and 8 as largest digit. A256708

Array A read by diagonals; n-th difference of (A(k,n), A(k,n-1),..., A(k,0)) is (k+2)^n-1, for n=1,2,3,...; k=0,1,2,... A47848

Inverse Mertens function: smallest k such that |M(k)| = n, where M(x) is Mertens's function A002321. A51402

a(n) is the smallest m for which 5^m contains n consecutive identical digits. A215728

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nXk array. A219939

T(n,k)=Number of length n+4 0..k arrays with no five consecutive terms having two times the sum of any three elements equal to three times the sum of the remaining two. A249001

T(n,k)=Number of nXk 0..1 arrays with row sums equal and column sums unequal to adjacent columns. A202742

T(n,k)=Number of length n+4 0..k arrays with no five consecutive terms having four times any element equal to the sum of the remaining four. A249466

Number of ways to choose a multiset of strict partitions, or odd partitions, of odd numbers, whose weights sum to n. A300300

List of distinct numbers appearing as denominators of Bernoulli numbers. A90801