Properties of the Number 81057

Eighty-One Thousand Fifty-Seven

Basics

Value: 81056 → 81057 → 81058

Parity: odd

Prime: No

Previous Prime: 81049

Next Prime: 81071

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 41 × 659

Divisors: 1, 3, 41, 123, 659, 1977, 27019, 81057

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10011110010100001

Octal: 236241

Duodecimal: 3AAA9

Hexadecimal: 13ca1

Square: 6570237249

Square Root: 284.70511059691216

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

T(n,k)=Rolling icosahedron face footprints: number of nXk 0..19 arrays starting with 0 where 0..19 label faces of an icosahedron and every array movement to a horizontal, diagonal or antidiagonal neighbor moves across an icosahedral edge. A223282

Expansion of exp( ∑_n>=1 σ(8·n)*xⁿ/n ) in powers of x. A283120

Rolling icosahedron face footprints: number of n X 3 0..19 arrays starting with 0 where 0..19 label faces of an icosahedron and every array movement to a horizontal, diagonal or antidiagonal neighbor moves across an icosahedral edge. A223277

Rolling icosahedron face footprints: number of 5Xn 0..19 arrays starting with 0 where 0..19 label faces of an icosahedron and every array movement to a horizontal, diagonal or antidiagonal neighbor moves across an icosahedral edge. A223286

Sum of squares of cycle lengths for different cycles in Fibonacci-like sequences modulo n. A233246

E.g.f.: ∑_n>=0 a(n)*xⁿ/n! = {∑_n>=0 F(n+1)*xⁿ/n!}², where F(n) is the n-th Fibonacci number. A81057