Properties of the Number -11200

Eleven Thousand Two Hundred

Basics

Value: -11201 → -11200 → -11199

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 4

Digital Root: 4

Palindrome: No

Factorization: 2 ⁶ × 5 ² × 7

Divisors: 1, 2, 4, 5, 7, 8, 10, 14, 16, 20

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10101111000000

Octal: -25700

Duodecimal: -6594

Hexadecimal: -2bc0

Square: 125440000

Square Root: 105.83005244258362

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) is the smallest error in trying to solve n⁴ = x⁴ + y⁴. That is, for each n from 2 on, find positive integers·and y, x <= y < n such that |n⁴ - x⁴ - y⁴| is minimal and let a(n) = n⁴ - x⁴ - y⁴. A308834

Triangle, read by rows, that equals the matrix inverse of A071207 when treated as a lower triangular matrix. A89962

Multiples of 4 whose digits add to 4. A63997

a(n) = 7·n². A33582

T(n,k)=Number of nondecreasing arrangements of n nonzero numbers in -(n+k-2)..(n+k-2) with sum zero. A188333

Triangle T(n,k) is the number of permutations on n elements with at least one k-cycle for 1 <= k <= n. A293211

Numbers k such that σ(x) = k has exactly 10 solutions. A60666

A triangle related to the a(n) formulas of the rows of the ED3 array A167572. A167580

Triangle read by rows: T(n, m) = S1(n, m)*8^n-m, where S1 are the signed Stirling numbers of first kind A008275 (n >= 1, 1 <= m <= n). A51187

T(n,k)=Number of nXk 0..4 arrays with each element equal to the number of its horizontal and vertical neighbors less than or equal to itself. A196544