Properties of the Number -5597

Five Hundred Ninety-Seven

Basics

Value: -5598 → -5597 → -5596

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 29 × 193

Divisors: 1, 29, 193, 5597

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1010111011101

Octal: -12735

Duodecimal: -32A5

Hexadecimal: -15dd

Square: 31326409

Square Root: 74.81310045707235

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(n) = -5·a(n-1)-2·a(n-2), n>1 ; a(0)=1, a(1)=-1 . A152594

Numerators of the partial alternating sums of the reciprocals of the alternating sum of divisors function (A206369). A379621

Composite numbers whose divisors (except 1) all contain the digit 9. A62680

a(n) = 5·a(n-1) - 2·a(n-2) for n>1, with a(0) = 1, a(1) = 3. A52984

a(n) = 5·a(n-2) - 2·a(n-4), with initial terms 0,1,1,3. A5824

Sum of gcd(x, y) for 1 <= x, y <= n. A18806

Sum of largest parts (counted with multiplicity) of all partitions of n. A92321

Composites whose prime factorization in base 6 is an anagram of the number in base 6. A260050

Number of magic labelings with magic sum n of first graph shown in link. A244869

Triangle read by rows: T(n,k) (1 <= k <= n) given by T(n, 1) = T(n,n) = 1, otherwise T(n, k) = (m·n-m·k+1)*T(n-1,k-1) + (m·k-m+1)*T(n-1,k), where m = 6. A142461