Properties of the Number -35131

Thirty-Five Thousand One Hundred Thirty-One

Basics

Value: -35132 → -35131 → -35130

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 19 × 43 ²

Divisors: 1, 19, 43, 817, 1849, 35131

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000100100111011

Octal: -104473

Duodecimal: -183B7

Hexadecimal: -893b

Square: 1234187161

Square Root: 187.43265457224896

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

Alternating sum of centered octagonal pyramidal numbers. A270695

Trajectory of 18 under iteration of the map k -> A087712(k). A77960

Consider the Diophantine equation x³ + y³ = z³ + 1 (1 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791). Sequence gives values of x. A50792

a(n) = sum of squares of first n positive integers congruent to 1 mod 4. A24381

Numerators of row 4 of table described in A051714/A051715. A51722

In Zeckendorf representation: integers that set a new record for the number of Reverse and Add steps (A349239) needed to reach a palindrome (A094202). A348571

Numbers n with property that n² contains "1234" as a substring. A175464

Expansion of g.f. -(1+x)*(1+sqrt(1-4·x))/(2*(1-x-x²)). A201164

a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1, 2] as of [2, 2, 1]. A211294

Number of partitions satisfying cn(0,5) <= cn(1,5) and cn(0,5) <= cn(4,5). A39837