Properties of the Number -10786

Ten Thousand Seven Hundred Eighty-Six

Basics

Value: -10787 → -10786 → -10785

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 5393

Divisors: 1, 2, 5393, 10786

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -10101000100010

Octal: -25042

Duodecimal: -62AA

Hexadecimal: -2a22

Square: 116337796

Square Root: 103.85566907973777

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: T(n,r) is the number of not necessarily connected r-regular graphs with n nodes, 0 <= r < n. A51031

Number of connected regular graphs of degree 8 with n nodes. A14378

Number of compositions of n whose run-lengths cover an initial interval of positive integers. A329766

Number of 4-valent (or quartic) graphs with n nodes. A33301

Triangular array C(n,r) = number of connected r-regular graphs, having girth exactly 3, with n nodes, for 0 <= r < n. A186733

Irregular triangle C(n,g) counting the connected 8-regular simple graphs on n vertices with girth at least g. A184981

Number of connected 8-regular simple graphs on n vertices with girth exactly 3. A184983

Number of not necessarily connected 8-regular simple graphs on n vertices. A180260

Irregular triangle C(n,g) counting the connected 8-regular simple graphs on n vertices with girth exactly g. A184980

Triangular array E(n,k) counting, not necessarily connected, k-regular simple graphs on n vertices with girth exactly 3. A185643