Properties of the Number -35908

Thirty-Five Thousand Nine Hundred Eight

Basics

Value: -35909 → -35908 → -35907

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 47 × 191

Divisors: 1, 2, 4, 47, 94, 188, 191, 382, 764, 8977

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000110001000100

Octal: -106104

Duodecimal: -18944

Hexadecimal: -8c44

Square: 1289384464

Square Root: 189.49406323154295

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

Array: row n shows the coefficients of the characteristic polynomial of the n-th principal submatrix of the symmetric matrix A202970; by antidiagonals. A202971

Numbers k such that 10^k+9^k-1 is prime. A96186

T(n,k) = Number of n X k 0..1 arrays with every element equal to 0, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero. A298508

Column 1 of triangle A128592; a(n) = coefficient of qⁿ⁺² in the q-analog of the odd double factorials (2n+3)!! for n>=0. A128593

Triangle, read by rows, of coefficients of q^nk+k in the q-analog of the odd double factorials: T(n,k) = [q^nk+k] ∏_j=1..n+1 (1-q^2j-1)/(1-q) for n>0, with T(0,0)=1. A128592

Number of partitions of the (n+3)-multiset {0,...,0,1,2,3} with n 0's into distinct multisets. A346823

Number of nX4 0..1 arrays with every element equal to 0, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero. A298504

Number of nX7 0..1 arrays with every element equal to 0, 2, 3, 4 or 7 king-move adjacent elements, with upper left element zero. A298507