Properties of the Number -34130

Thirty-Four Thousand One Hundred Thirty

Basics

Value: -34131 → -34130 → -34129

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5 × 3413

Divisors: 1, 2, 5, 10, 3413, 6826, 17065, 34130

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: -1000010101010010

Octal: -102522

Duodecimal: -17902

Hexadecimal: -8552

Square: 1164856900

Square Root: 184.74306482247175

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

Generalized Pellian with second term of 6. A48875

Number of parts in all partitions of n in which every integer from the smallest part to the largest part occurs as a part. A117457

Lower midsequence of the Fibonacci numbers (1,2,3,5,8,...) and Lucas numbers (1,3,4,7,11,...); see Comments. A355324

Upper midsequence of the Fibonacci numbers (1,2,3,5,8,...) and Lucas numbers (1,3,4,7,11,...); see Comments. A355325

Maximal term in row n of sequence A240388 when regarded as a triangle. A244470

a(n) = a(n-2) - 2a(n-3) + a(n-4) for n>3, with a(0)=2, a(1)=0, a(2)=1, a(3)=-1, a sequence related to Pellian numbers. A292521

a(0) = 1; thereafter a(n) = n*∑_k=0..n-1 binomial(n,k) * a(k). A367308

Consider all ways of writing the composite Fibonacci number A090206(n+3) as product of two divisors d1·d2 = d3·d4 = ... The sequence a(n) gives the minimum sums of {d1+d2, d3+d4,...}. A287273