Properties of the Number -28055

Twenty-Eight Thousand Fifty-Five

Basics

Value: -28056 → -28055 → -28054

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 31 × 181

Divisors: 1, 5, 31, 155, 181, 905, 5611, 28055

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -110110110010111

Octal: -66627

Duodecimal: -1429B

Hexadecimal: -6d97

Square: 787083025

Square Root: 167.49626861515452

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 Chebyshev S-sequence with Diophantine property. A78362

a(n) = n⁴ - 3·n² + 1. A57722

Denominators of continued fraction convergents to sqrt(165). A41305

Denominators of continued fraction convergents to sqrt(660). A42269

Fibonacci sequence beginning 12, 67. A91074

Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and such that the sum of the bottom levels of all columns is k (n>=1, k>=0; informally, the number of the "missing" cells in the right bottom corner of the polyomino). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column. A122104

Number of conjugacy classes for a non-abelian group of order p³, where p is prime: a(n) = p² + p - 1 where p = prime(n). A319597

a(n) is the largest k such that the sum of k consecutive reciprocals 1/p_n + ... + 1/p_n+k-1 does not exceed 1 (where p_n = n-th prime). A327600