Properties of the Number 87312

Eighty-Seven Thousand Three Hundred Twelve

Basics

Value: 87311 → 87312 → 87313

Parity: even

Prime: No

Previous Prime: 87299

Next Prime: 87313

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ⁴ × 3 × 17 × 107

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 17, 24

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10101010100010000

Octal: 252420

Duodecimal: 42640

Hexadecimal: 15510

Square: 7623385344

Square Root: 295.4860402794014

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

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 809", based on the 5-celled von Neumann neighborhood. A284178

McKay-Thompson series of class 20b for Monster. A58557

Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 7 (most significant digit on right). A61936

Number of (n+1) X (5+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A234879

Number of (n+1) X (7+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A234881

Number of 2 X n 0..2 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once. A269053

T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 1, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings). A234882

Irregular table read by rows: Take a Reuleaux triangle with all diagonals drawn, as in A340639. Then T(n,k) = number of k-sided polygons in that figure for k >= 3. A340614

a(1) = 1; for n > 1, a(n) is the smallest number == -1 (mod a(n-1)), greater than n, with the same prime signature as n. A87312