Properties of the Number 28010

Twenty-Eight Thousand Ten

Basics

Value: 28009 → 28010 → 28011

Parity: even

Prime: No

Previous Prime: 28001

Next Prime: 28019

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 2801

Divisors: 1, 2, 5, 10, 2801, 5602, 14005, 28010

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 110110101101010

Octal: 66552

Duodecimal: 14262

Hexadecimal: 6d6a

Square: 784560100

Square Root: 167.36188335460378

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

T(n,k)=Number of nXk 0..1 arrays with no element equal to more than four of its king-move neighbors and with new values introduced in order 0 sequentially upwards. A281837

Number of nX2 0..1 arrays with no element equal to more than four of its king-move neighbors and with new values introduced in order 0 sequentially upwards. A281831

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero. A299001

T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero. A299081

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero. A299668

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 4 or 5 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A318214

Sum over the genera g of the number of immersions of an unoriented circle with n crossing in an oriented surface of genus g. A260847

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 6 or 8 king-move adjacent elements, with upper left element zero. A299746

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 7 or 8 king-move adjacent elements, with upper left element zero. A299844

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero. A300259