Properties of the Number 8137

Eight Thousand One Hundred Thirty-Seven

Basics

Value: 8136 → 8137 → 8138

Parity: odd

Prime: No

Previous Prime: 8123

Next Prime: 8147

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 79 × 103

Divisors: 1, 79, 103, 8137

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1111111001001

Octal: 17711

Duodecimal: 4861

Hexadecimal: 1fc9

Square: 66210769

Square Root: 90.20532135079394

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

a(n) = lcm(A051612(n), A065387(n)), where A051612(n) = σ(n) - φ(n) and A065387(n) = σ(n) + φ(n). A77100

Semiprimes whose prime factors are of equal binary length and which differ from each other in exactly two bit positions. A261074

Number of k < 10ⁿ such that A047988(k) = 3. A213532

Number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 155", based on the 5-celled von Neumann neighborhood. A270325

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 589", based on the 5-celled von Neumann neighborhood. A289574

a(n) = A051612(n)*A065387(n) = σ(n)²-φ(n)², where A051612(n) = σ(n) - φ(n) and A065387(n) = σ(n) + φ(n). A77101

Number of triangular partitions of n of order 3. A84439

Coefficient of·in the reduction by x² -> x+1 of the polynomial p(n,x) defined at Comments. A192972

Triangle read by rows: T(n, k) is the number of k-dimensional subspaces in (F₃)ⁿ, counted up to coordinate permutation (n >= 0, 0 <= k <= n). A347970

Nonnegative integers k such that the Euclidean distance between the vector of proportions of the digits 0-9 in 2^k and the uniform distribution (1/10, ..., 1/10) sets a new minimum. A393331