Properties of the Number -17793

Seventeen Thousand Seven Hundred Ninety-Three

Basics

Value: -17794 → -17793 → -17792

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 659

Divisors: 1, 3, 9, 27, 659, 1977, 5931, 17793

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100010110000001

Octal: -42601

Duodecimal: -A369

Hexadecimal: -4581

Square: 316590849

Square Root: 133.39040445249427

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(0) = 0. For n > 0, smallest non-palindromic number k such that the smallest palindrome in the Reverse and Add! trajectory of k is reached after exactly n iterations. A23109

Number of rooted thrice-partitions of n. A301706

G.f.: ∏_{k>=1, j>=1} (1+x^j·k²). A280451

Square array, read by antidiagonals: form the Euler-Seidel matrix for the sequence {2^k*k!} and then divide column k by 2^k*k!. A143411

a(n) = 140·2ⁿ - 127. A305262

a(n) = Fibonacci(p) mod p², where p = prime(n). A236395

Smallest k such that the smallest palindrome > k in the Reverse and Add! trajectory of k is reached after exactly n iterations. A15994

An INVERT sequence for A010054. A181649

Number of partitions of n containing at least one part m-6 if m is the largest part. A212546

Least number of Reverse-then-add persistence n. A33866