Properties of the Number -6039

Thirty-Nine

Basics

Value: -6040 → -6039 → -6038

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 11 × 61

Divisors: 1, 3, 9, 11, 33, 61, 99, 183, 549, 671

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -1011110010111

Octal: -13627

Duodecimal: -35B3

Hexadecimal: -1797

Square: 36469521

Square Root: 77.71100308193171

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

G.f. satisfies: A(x) = 1/(1 + x·A(x⁶)) and also the continued fraction: 1+x·A(x⁷) = [1;1/x,1/x⁶,1/x³⁶,1/x²¹⁶,...,1/x^{6^(n-1}),...]. A101916

a(n) = 5·a(n-2) + 2·a(n-3). A135949

Numbers k such that k and k+1 are both base φ Niven numbers (A334308). A334309

a(n) = n*(11·n + 3)/2. A254963

Expansion of g.f. (x²+x+1)*(2·x²+2·x+1)*(x-1)²/((1-x²-2·x³)*(x⁴+1)). A107850

Partial sums of A051740. A51877

Divisors = 3 (mod 4) of Descartes's 198585576189. A33871

For 1<=x<=n, 1<=y<=n, write gcd(x,y) = u·x+v·y with u,v minimal; a(n) = sum of the values of |v|. A345433

Primitive terms of A359563: terms of A359563 with no proper divisor in A359563. A359564

a(n) = n*(25·n - 1)/2. A22282