Properties of the Number -10797

Ten Thousand Seven Hundred Ninety-Seven

Basics

Value: -10798 → -10797 → -10796

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 59 × 61

Divisors: 1, 3, 59, 61, 177, 183, 3599, 10797

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10101000101101

Octal: -25055

Duodecimal: -62B9

Hexadecimal: -2a2d

Square: 116575209

Square Root: 103.90861369491944

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

Expansion of ∏_{r = 1 or not a perfect power} 1/(1 - x^r). A305630

T(n,k)=1/6 the number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock containing all three values. A183603

T(n,k)=Number of nXk 0..1 arrays with rows, columns, diagonals and antidiagonals unimodal. A223644

Number of distinct sums i³ + j³ + k³ + l³ for 1<=i<=j<=k<=l<=n. A374714

a(n) = floor( n*(n-1)*(n-2)/20 ). A11902

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

a(n) = (a(n-1) * a(n-3) - (-1)ⁿ * a(n-2)²) / a(n-4) with a(1) = a(3) = a(4) = 1, a(2) = -2. A247378

Number of set partitions of [n] into exactly four parts such that no part contains two elements with a circular distance less than three. A261480

a(n) is the number of triangles (up to congruence) with integer coordinates that have perimeter strictly less than n. A298121