Properties of the Number 71888

Seventy-One Thousand Eight Hundred Eighty-Eight

Basics

Value: 71887 → 71888 → 71889

Parity: even

Prime: No

Previous Prime: 71887

Next Prime: 71899

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 2 ⁴ × 4493

Divisors: 1, 2, 4, 8, 16, 4493, 8986, 17972, 35944, 71888

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001100011010000

Octal: 214320

Duodecimal: 35728

Hexadecimal: 118d0

Square: 5167884544

Square Root: 268.1193763979023

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) binary arrays with every 2X2 subblock sum equal to exactly one or two horizontal and vertical neighbor 2X2 subblock sums. A188311

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or vertically, with no adjacent elements equal. A232406

Expansion of (1/x) * Series_Reversion( x * (1-x)³ / (1+x²)³ ). A369264

Number of (n+1)X3 binary arrays with every 2X2 subblock sum equal to exactly one or two horizontal and vertical neighbor 2X2 subblock sums. A188304

Number of (n+1)X(5+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or vertically, with no adjacent elements equal. A232403

Number of (n+1)X(6+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or vertically, with no adjacent elements equal. A232404

Number of (n+1)X7 binary arrays with every 2X2 subblock sum equal to exactly one or two horizontal and vertical neighbor 2X2 subblock sums. A188308

a(1)=2 and for n>1 a(n) = least squarefree m > n with gcd(m,n)>1. A71888