Properties of the Number -35287

Thirty-Five Thousand Two Hundred Eighty-Seven

Basics

Value: -35288 → -35287 → -35286

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 7 × 71 ²

Divisors: 1, 7, 71, 497, 5041, 35287

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1000100111010111

Octal: -104727

Duodecimal: -18507

Hexadecimal: -89d7

Square: 1245172369

Square Root: 187.84834308558592

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

Number A(n,k) of spanning trees in C_k X P_n; square array A(n,k), n>=1, k>=1, read by antidiagonals. A173958

Number of strings of length n over a 7-letter alphabet that begin with a nontrivial palindrome. A249640

Numbers n such that ∑_i=1..n (i')ⁱ == 0 (mod n), where i' is the arithmetic derivative of i. A227848

Numbers k such that σ(k) = ψ(k) + τ(k) + ω(k). A386637

E.g.f. satisfies log(A(x)) = (exp(x·A(x)) - 1) * x. A349560

Complexity of doubled cycle (regarding case n = 2 as a multigraph). A6235

Number of spanning trees in C₇ X P_n. A158898

Numbers of the form p²*q, with odd primes p > q, such that q divides p-1. A350638

Complexity of doubled cycle (regarding case n = 2 as a graph). A72373

Array read by antidiagonals: total number of spanning trees R_n(m) of the complete prism K_m X C_n. A175243