Properties of the Number 80488

Eighty Thousand Four Hundred Eighty-Eight

Basics

Value: 80487 → 80488 → 80489

Parity: even

Prime: No

Previous Prime: 80473

Next Prime: 80489

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 10061

Divisors: 1, 2, 4, 8, 10061, 20122, 40244, 80488

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011101001101000

Octal: 235150

Duodecimal: 3A6B4

Hexadecimal: 13a68

Square: 6478318144

Square Root: 283.70407117276267

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 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 nXk array. A219299

Number of n X 2 0..1 arrays with every element equal to 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero. A297945

Expansion of 1/(1 - x*(1 + theta₃(x))/2), where theta₃() is the Jacobi θ function. A302018

Number of nX5 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 nX5 array. A219296

Number of n X 3 0..1 arrays with every element unequal to 0, 2, 3 or 6 king-move adjacent elements, with upper left element zero. A304136

Numbers which can be written uniquely as x⁴ + y*(2y+1) + z*(3z+1), where x,y,z are integers with x>=0. A334147

Number of n X n arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 n X n array. A219292

a(1) =3, a(n) = smallest multiple of a(n-1) (not equal to 10^k*a(n-1)) obtained by inserting digits anywhere in a(n-1). A80488

Moessner triangle using the Fibonacci terms. A125752

Number of ways to write n as x⁴ + y*(2·y+1) + z*(3·z+1), where·is a nonnegative integer, and y and z are integers. A334138