Properties of the Number -10700

Ten Thousand Seven Hundred

Basics

Value: -10701 → -10700 → -10699

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 5 ² × 107

Divisors: 1, 2, 4, 5, 10, 20, 25, 50, 100, 107

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -10100111001100

Octal: -24714

Duodecimal: -6238

Hexadecimal: -29cc

Square: 114490000

Square Root: 103.440804327886

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

a(n) = C(n,1) + C(n,2) + C(n,3), or n*(n² + 5)/6. A4006

Numbers in which 0 outnumbers all other digits together. A292730

T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by other than plus or minus one modulo k+1. A269678

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one. A238072

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = (natural numbers), t = (natural numbers >= 3). A24854

a(n) = ∑_k=0..7 (n + k)². A276026

Total number of occurrences of the pattern 1<2<3 in all preferential arrangements (or ordered partitions) of n elements. A240800

G.f.: ∑_k>=1 x^2·k-1/(1+x^2·k-1) * ∏_k>=1 (1+x^k)/(1-x^k). A305124

Number of series-reduced rooted identity trees whose leaves are strict integer partitions whose multiset union is an integer partition of n. A320177

Number of integer partitions of n for which the parts have the same median as the multiplicities. A360456