Properties of the Number -16617

Sixteen Thousand Six Hundred Seventeen

Basics

Value: -16618 → -16617 → -16616

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 29 × 191

Divisors: 1, 3, 29, 87, 191, 573, 5539, 16617

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100000011101001

Octal: -40351

Duodecimal: -9749

Hexadecimal: -40e9

Square: 276124689

Square Root: 128.90694317995442

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

53 'Reverse and Add' steps are needed to reach a palindrome. A65320

Consider the Diophantine equation x³ + y³ = z³ + 1 (1 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791). Sequence gives values of x. A50792

Numerators of continued fraction convergents to sqrt(983). A42902

Numbers for which the root mean square of nontrivial divisors is an integer and which are not a square of prime numbers. A247137

a(n) is the least number k such that the continued fraction for φ(k)/k contains exactly n elements. A342867

Triangle read by rows: T(n,k) = number of free hexagonal polyominoes with n cells, where the maximum number of cells on any lattice line is k. The term "lattice line" here means a line running through the cell centers and midpoints of their sides. A378014

Expansion of (1+3·x²+7·x³+15·x⁴+13·x⁵+15·x⁶+8·x⁷+4·x⁸)/((1-x)*(1-x²)³*(1-x³)²). A37241

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 0), (-1, 1, -1), (0, -1, 0), (1, 1, 0)}. A149117

Nonprime numbers k of the form 4·m+1 such that ∑_j=0..k-1 2^j * binomial(3·j, j) == 1 (mod k). A373747