Properties of the Number 17828

Seventeen Thousand Eight Hundred Twenty-Eight

Basics

Value: 17827 → 17828 → 17829

Parity: even

Prime: No

Previous Prime: 17827

Next Prime: 17837

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 4457

Divisors: 1, 2, 4, 4457, 8914, 17828

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100010110100100

Octal: 42644

Duodecimal: A398

Hexadecimal: 45a4

Square: 317837584

Square Root: 133.52153384379613

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 every element equal to 1, 2, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302728

T(n,k)=Two-loop graph coloring a rectangular array: number of nXk 0..4 arrays where 0..4 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223255

Number of isomorphism classes of nanocones with 3 pentagons and a nearsymmetric boundary of length n. A198014

Number of partitions of n such that (number parts having multiplicity 1) is not a part and (number of parts > 1) is not a part. A241514

Row sums of A095167. A95170

Number of connected subsets of n edges of the cuboctahedron up to the 48 rotations and reflections of the cuboctahedron. A383982

Two-loop graph coloring a rectangular array: number of n X 3 0..4 arrays where 0..4 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223250

Two-loop graph coloring a rectangular array: number of n X 4 0..4 arrays where 0..4 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223251

Number of n X 5 0..1 arrays with every element equal to 1, 2, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302725

Number of 7Xn 0..1 arrays with every element equal to 1, 2, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302732