Properties of the Number 87677

Eighty-Seven Thousand Six Hundred Seventy-Seven

Basics

Value: 87676 → 87677 → 87678

Parity: odd

Prime: No

Previous Prime: 87671

Next Prime: 87679

Digit Sum: 35

Digital Root: 8

Palindrome: No

Factorization: 43 × 2039

Divisors: 1, 43, 2039, 87677

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101011001111101

Octal: 253175

Duodecimal: 428A5

Hexadecimal: 1567d

Square: 7687256329

Square Root: 296.10302261206317

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 magic labelings of the cycle-of-loops graph LOOP X C₈ having magic sum n, where LOOP is the 1-vertex, 1-loop-edge graph. A244880

Number of vertices formed in a square by straight line segments when connecting the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on the edge on the opposite side of the square. A355799

Largest odd number that can be represented in no more than n ways as p + 2·i² where p is 1 or a prime and i >= 0. A46903

Largest odd number that can be represented in exactly n ways as p+2·i² where p is 1 or a prime and i >= 0. A55108

Rectangular array read by antidiagonals: A(n,k) = number of magic labelings of the graph LOOP X C_n (see comments) having magic sum k, n >= 1, k >= 0. A293311

Rectangular array read by antidiagonals: A(n,k) = tr((M_n)^k), k >= 0, where M_n is the n X n matrix M₁ = {{1}}, M_n = {{0,...,0,1},{0,...,0,1,1},...,{0,1,...,1},{1,...,1}}, n > 1, and tr(.) is the trace. A293312

Consider recurrence b(0) = n/3, b(n) = b(0)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached. A87677

Number of n X 5 nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 3 and every value within 3 of its king move distance from the upper left and every value increasing by 0 or 1 with every step right, diagonally se or down. A253001