Properties of the Number 86185

Eighty-Six Thousand One Hundred Eighty-Five

Basics

Value: 86184 → 86185 → 86186

Parity: odd

Prime: No

Previous Prime: 86183

Next Prime: 86197

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 5 × 11 × 1567

Divisors: 1, 5, 11, 55, 1567, 7835, 17237, 86185

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10101000010101001

Octal: 250251

Duodecimal: 41A61

Hexadecimal: 150a9

Square: 7427854225

Square Root: 293.57281890529305

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 different bracelets with 6 beads of at most n colors, allowing turning over. A27670

Triangle, read by rows, defined by T(n, k) = b(n) - b(k) - b(n-k) + 1, where b(n) = 5·b(n-1) - 4·b(n-2) + 3·b(n-3) - 2·b(n-4) - b(n-5) and b(0) = 0, b(1) = 1, b(2) = 5, b(3) = 21, b(4) = 88. A176483

T(n,k) = Number of n-bead necklaces of k colors allowing reversal, with no adjacent beads having the same color. A208544

Table T(n,k) read by antidiagonals: number of necklaces allowing turnovers (bracelets) with n beads of k colors. A51137

Table read by descending antidiagonals: T(n,k) is the number of unoriented cycles (bracelets) of length n using up to k available colors. A321791

In decimal expansion of π: smallest position between n and 2·n where the greatest number begins which is also contained in the first n positions. A86185