ℕ atory
Play Now

Properties of the Number -6130

One Hundred Thirty

Basics

Value: -6131 → -6130 → -6129

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 × 5 × 613

Divisors: 1, 2, 5, 10, 613, 1226, 3065, 6130

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1011111110010

Octal: -13762

Duodecimal: -366A

Hexadecimal: -17f2

Square: 37576900

Square Root: 78.29431652425353

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+3) = 3·a(n+2) - 2·a(n+1) + 1 with a(0)=0, a(1)=2. A95151
Expansion of g.f. A(x) satisfying ∑n=-oo..+oo (xn - 9·A(x))n = 1 - 7*∑n>=1 xn2. A370039
T(n,k) = number of arrays of the median of three adjacent elements of some length n+2 0..k array. A228740
a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2p+1 and p is the unique integer such that 2p < n - 1 <= 2p+1, starting with a(1) = a(2) = 1 and a(3) = 2. A50028
a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2p+1 and p is the unique integer such that 2p < n - 1 <= 2p+1, starting with a(1) = 1 and a(2) = a(3) = 2. A50044
a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2p+1 and p is the unique integer such that 2p < n - 1 <= 2p+1, starting with a(1) = 1, a(2) = 3, and a(3) = 2. A50060
Total number of 9's digits in primes less than 10n. A231598
Number of partitions of n such that the number of odd parts is a part. A240574
Number of different ways one can attack all squares on an n X n chessboard with n rooks. A248744
Array read by antidiagonals: T(m,n) = number of minimal dominating sets in the rook graph Km X Kn. A290632