Properties of the Number -35955

Thirty-Five Thousand Nine Hundred Fifty-Five

Basics

Value: -35956 → -35955 → -35954

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 5 × 17 × 47

Divisors: 1, 3, 5, 9, 15, 17, 45, 47, 51, 85

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1000110001110011

Octal: -106163

Duodecimal: -18983

Hexadecimal: -8c73

Square: 1292762025

Square Root: 189.6180371167258

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

Triangle read by rows giving the sum of the number of k-matchings of the graphs obtained by deleting one edge and its two vertices from the ladder graph L_n = P₂ X P_n in all possible ways. A318243

Solution of the complementary equation a(n) = a(n-1) + a(n-3) + a(n-4) + b(n-4), where a(0) = 1, a(1) = 2, a(2) = 3, a(3) = 4, b(0) = 5, b(1) = 6, b(2) = 7, b(3) = 8, and (a(n)) and (b(n)) are increasing complementary sequences. A295754

a(n) is the least m such that a period of the continued fraction expansion of sqrt(m) is 1,1,1,...,1,1,1,Z and there are n ones in the period (Z is 2·floor(sqrt(m))). If no such m exists, a(n) = 0. A71296

Least a(n) such that the period of continued fraction for sqrt(a(n)) has at least n successive 1's. A60215

Number of 2-Abelian equivalence classes of words of length n over an alphabet of size 3. A289658

a(n) is the least k such that the denominators of continued fraction convergents for sqrt(k) match the first n Fibonacci numbers. A309666