Properties of the Number 83304

Eighty-Three Thousand Three Hundred Four

Basics

Value: 83303 → 83304 → 83305

Parity: even

Prime: No

Previous Prime: 83299

Next Prime: 83311

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ³ × 3 ² × 13 × 89

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 13, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10100010101101000

Octal: 242550

Duodecimal: 40260

Hexadecimal: 14568

Square: 6939556416

Square Root: 288.62432329933665

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

Column of Motzkin triangle. A5322

T(n,k)=Number of city-block distance 1, pressure limit 2 movements in an nXk array with each element moving exactly one horizontally or vertically, no element acquiring more than two neighbors, and without 2-loops. A216991

Positive integers i for which A112049(i) == 9. A112069

First differences of triangular numbers with square pyramidal indices. A77538

Triangle read by rows: T(n,k) is number of Grand Motzkin paths of length n having k returns to the x-axis from above (i.e., d steps hitting the x-axis). A109195

Number of city-block distance 1, pressure limit 2 movements in an nX3 array with each element moving exactly one horizontally or vertically, no element acquiring more than two neighbors, and without 2-loops. A216986

Number of city-block distance 1, pressure limit 2 movements in an nX5 array with each element moving exactly one horizontally or vertically, no element acquiring more than two neighbors, and without 2-loops. A216988

Greatest number in row of n array T given by A026300. A26938

Irregular triangle read by rows: T(n,m) = number of lattice paths of type A^Q terminating at point (n, m). A291083

a(n) = (4*(n+5)ⁿ + nⁿ)/5. A83304