Properties of the Number 82159

Eighty-Two Thousand One Hundred Fifty-Nine

Basics

Value: 82158 → 82159 → 82160

Parity: odd

Prime: No

Previous Prime: 82153

Next Prime: 82163

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 7 × 11 ² × 97

Divisors: 1, 7, 11, 77, 97, 121, 679, 847, 1067, 7469

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10100000011101111

Octal: 240357

Duodecimal: 3B667

Hexadecimal: 140ef

Square: 6750101281

Square Root: 286.63391285749844

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) = C(n,6) + C(n,5) + C(n,4) + C(n,3) + C(n,2) + C(n,1). A115567

Define the sequence T(a(0),a(1)) by a(n+2) is the greatest integer such that a(n+2)/a(n+1) < a(n+1)/a(n) for n >= 0. This is T(4,11). A19495

Number of ways that a 1 X n rectangular tile T, marked into n unit squares, can be surrounded by one layer of copies of itself laid in the plane grid generated by the units of T. Ways that differ by rotation or reflection are not counted as different. The surrounded tile is the exact surrounded region. A159294

Numbers k such that A109631(k) - A109631(k+1) = A109631(k+2). A109715

Number of deterministic completely defined acyclic automata with 2 inputs and n+1 transient labeled states including a unique state having all transitions to the absorbing state. A82159