Properties of the Number 87237

Eighty-Seven Thousand Two Hundred Thirty-Seven

Basics

Value: 87236 → 87237 → 87238

Parity: odd

Prime: No

Previous Prime: 87223

Next Prime: 87251

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ⁵ × 359

Divisors: 1, 3, 9, 27, 81, 243, 359, 1077, 3231, 9693

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10101010011000101

Octal: 252305

Duodecimal: 42599

Hexadecimal: 154c5

Square: 7610294169

Square Root: 295.3591034655949

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

Number of 0..n-1 integer arrays v[1..6] of length 6 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..5. A171357

a(n) is the number of 5 element sets of distinct integer-sided trapezoids whose base angles are 60 degrees that fill an equilateral triangular grid of side n units, where one trapezoid has a larger base of n units. A391453

Number of 0..6 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171312

Number of length 3+2 0..n arrays with the sum of second differences squared multiplied by some arrangement of +-1 equal to zero. A250322

Number of (not necessarily maximal) cliques in the n X n white bishop graph. A295910

T(n,m) = number of 0..m-1 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171307

a(n) = (Max{x : n*π(x) = x} - Min{x : n*π(x) = x})/n = A087236(n)/n. A87237