Properties of the Number -111104

One Hundred Eleven Thousand One Hundred Four

Basics

Value: -111105 → -111104 → -111103

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 ⁹ × 7 × 31

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 31, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11011001000000000

Octal: -331000

Duodecimal: -54368

Hexadecimal: -1b200

Square: 12344098816

Square Root: 333.32266649599455

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

E.g.f. log(sech(x) + tan(x)). A13204

T(n,k)=Number of nXk 0..2 arrays with exactly floor(nXk/2) elements equal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order. A223104

Number of integer partitions of n where some part is the difference of two consecutive parts. A364467

Triangle read by rows: T(n,k), 1 <= k <= n, is the number of non-degenerate fanout-free Boolean functions of n variables having AND rank k. A225171

Number of nX1 0..2 arrays with exactly floor(nX1/2) elements equal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..2 order. A222884

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 363", based on the 5-celled von Neumann neighborhood. A281417

Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 433", based on the 5-celled von Neumann neighborhood. A288202

a(n) = n+1 for n = 1 to 8; a(n) = 100 + a(n-8) for n = 9 to 16; thereafter a(8·i+j) = 10ⁱ⁺¹ + a(8*(i-1)+j) for i >= 2, 1 <= j <= 8. A367342

Number of nX2 0..2 arrays with exactly floor(nX2/2) elements equal to at least one horizontal or antidiagonal neighbor, with new values introduced in row major 0..2 order. A223098

Number of length 3+2 0..n arrays with no three consecutive terms having the sum of any two elements equal to twice the third. A248464