Properties of the Number -171886

One Hundred Seventy-One Thousand Eight Hundred Eighty-Six

Basics

Value: -171887 → -171886 → -171885

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 2 × 11 × 13 × 601

Divisors: 1, 2, 11, 13, 22, 26, 143, 286, 601, 1202

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7989 Try Today's Challenge

Representations

Binary: -101001111101101110

Octal: -517556

Duodecimal: -8357A

Hexadecimal: -29f6e

Square: 29544796996

Square Root: 414.59136508132923

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 of tournament sequences: sequences (a₁, a₂, ..., a_n) with a₁ = 1 such that a_i < a_i+1 <= 2·a_i for all i. A8934

Lower triangular matrix T, read by rows, such that row (n) is formed from the sums of adjacent terms in row (n-1) of the matrix square T², with T(0,0)=1. A97710

Number of isomorphism classes of connected 4-regular loopless multigraphs of order n. A129417

Square table T, read by antidiagonals, where T(n,k) gives the number of n-th generation descendents of a node labeled (k) in the tree of tournament sequences. A93729

Square table, read by antidiagonals, where T(n,k) equals the number of k-tournament sequences of length n for k>=1, with T(0,k) = 1 for k>=1 and T(n,1) = 0 for n>0. A113080

Number of n X n symmetric binary arrays with rows, considered as binary numbers, in strictly increasing order, and no more than 6 ones in any row. A162096