Recognised as Number
-112,098
- Negative
- Even
- 6 digits
-112,098 is an even 6-digit integer and the negative of 112,098. It has 32 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value112,098
Digit count6
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 3 × 7 × 17 × 157
Distinct prime factors52, 3, 7, 17, 157
Number of divisors32
Sum of divisors σ(n)273,024
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 7, 14, 17, 21, 34, 42, 51, 102, 119, 157, 238, 314, 357, 471, 714, 942, 1,099, 2,198, 2,669, 3,297, 5,338, 6,594, 8,007, 16,014, 18,683, 37,366, 56,049, 112,09832 in total
Arithmetic
Representations
Decimal-112,098
Binary1101101011110001017 bits
Octal332742
Hexadecimal1B5E2
Base 362EHU
In wordsminus one hundred and twelve thousand and ninety-eight
Ordinalminus one hundred and twelve thousand and ninety-eighth
Scientific notation-1.12098 × 10^5
Engineering notation-112.098 × 10^3
In other bases
Ternary12200202210base 3; the most digit-efficient integer base after e: 11 digits
Quinary12041343base 5; one hand: 8 digits
Septenary644550base 7: 6 digits
Nonary180683base 9; each digit is two ternary digits: 6 digits
Duodecimal54a56base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimale04ibase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal31:8:18base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1010T1T01T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101111001100010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100100101000011110
Bit length17 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits7within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 b5 e2
Gray code10110111100010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100100101000011110two's complement
64-bit1111111111111111111111111111111111111111111111100100101000011110two's complement
One's complement00000000000000011011010111100001at 32 bits, every bit flipped
Bits reversed01111000010100100111111111111111at 32 bits
Rotated left by 111111111111111001001010000111101at 32 bits, wrapping
Shifted left by 1-110110101111000100= -224,196, no wrap
Shifted right by 1-1101101011110001= -56,049, discarding the low bit
These bits as a double5.53837708 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-112,098 to the power 212,565,961,604
-112,098 to the power 3-1,408,619,163,885,192
-112,098 to the power 4157,903,391,033,202,252,816
-112,098 to the power 5-17,700,654,328,039,906,136,167,968
First ten multiples-112,098, -224,196, -336,294, -448,392, -560,490, -672,588, -784,686, -896,784, -1,008,882, -1,120,980
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9No, remainder 3
Divisible by 10No, remainder 8
Divisible by 11No, remainder 8
Divisible by 12No, remainder 6
Divisible by 100No, remainder 98
As a percentage & fraction
As a percentage-11,209,800%
-112,098% as a decimal-1,120.98
-112,098% of 100-112,098
-112,098% of 1,000-1,120,980
As a fraction of 100-112,098/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -112,098
Nerdulate something else
Nothing in mind? Surprise me · today’s page