Properties of the Number 83088

Eighty-Three Thousand Eighty-Eight

Basics

Value: 83087 → 83088 → 83089

Parity: even

Prime: No

Previous Prime: 83077

Next Prime: 83089

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ² × 577

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10100010010010000

Octal: 242220

Duodecimal: 40100

Hexadecimal: 14490

Square: 6903615744

Square Root: 288.2498915871435

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 (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having exactly three clockwise edge increases. A206327

Triangle read by rows: T(n,k) is the number of rooted loopless planar maps with n edges, k faces and no isthmuses, n >= 0, k = 1..n+1. A342980

a(n) = (1/12)*n²*(3*(1 + n²) - 2*(2 + n²)*(n mod 2)). A322844

Number of partitions of n in which the number of prime parts is not equal to the number of nonprime parts. A355306

Coordination sequence for 4-dimensional primitive di-isohexagonal orthogonal lattice. A8530

Expansion of φ(x)² / φ(-x²) in powers of·where φ() is a Ramanujan θ function. A260314

Number of (n+1) X 2 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly three clockwise edge increases. A206320

Number of (n+1)X5 0..3 arrays with every 2X3 or 3X2 subblock having exactly three clockwise edge increases. A206323

First column of table A083087. A83088

Number of (n+1) X (2+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A234668