Properties of the Number -1111121

One Hundred Eleven Thousand One Hundred Twenty-One

Basics

Value: -1111122 → -1111121 → -1111120

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 11 × 83 × 1217

Divisors: 1, 11, 83, 913, 1217, 13387, 101011, 1111121

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -100001111010001010001

Octal: -4172121

Duodecimal: -457015

Hexadecimal: -10f451

Square: 1234589876641

Square Root: 1054.0972440908856

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

Unique representation of nonnegative numbers by iterated tribonacci A, B and C sequences. A316713

Leftmost 1 is converted to a 2, which then propagates one step at a time until it is rightmost; then it changes to a pair of 1's and the process repeats. A71762

Numbers with digital product = 2. A199986

Positive integers m such that m * (m+1) contains at least 8 decimal digits that are in neither m nor m+1. A381247

a(1) = 1, then the smallest number not included earlier and not a string of 1's such that the concatenation a(n), a(n+1) is a palindrome. A83122

Composite numbers whose product of digits is 2. A201015

To concatenate all terms, to concatenate the odd rank terms or to concatenate the even rank terms produces the same result. A299823

Numbers n that are divisible by d, where a_i for 1 <= i <= k are the digits of n and d = ∏_i=1..kSum_of_digits_of_{a_i^k}. A128870

a(n) is the smallest integer that contains a(n-1) but does not begin with a(n-1). A179956