Recognised as Number
-112,991
- Negative
- Odd
- 6 digits
-112,991 is an odd 6-digit integer and the negative of 112,991. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value112,991
Digit count6
Digit sum23
Digit product162
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 103 × 1,097
Distinct prime factors2103, 1,097
Number of divisors4
Sum of divisors σ(n)114,192
SquarefreeYesno repeated prime factor
All divisors1, 103, 1,097, 112,9914 in total
Arithmetic
Representations
Decimal-112,991
Binary1101110010101111117 bits
Octal334537
Hexadecimal1B95F
Base 362F6N
In wordsminus one hundred and twelve thousand, nine hundred and ninety-one
Ordinalminus one hundred and twelve thousand, nine hundred and ninety-first
Scientific notation-1.12991 × 10^5
Engineering notation-112.991 × 10^3
In other bases
Ternary12201222212base 3; the most digit-efficient integer base after e: 11 digits
Quinary12103431base 5; one hand: 8 digits
Septenary650264base 7: 6 digits
Nonary181885base 9; each digit is two ternary digits: 6 digits
Duodecimal5547bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimale29bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal31:23:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT101T1000011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101101111100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100100011010100001
Bit length17 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits5within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 b9 5f
Gray code10110010111110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100100011010100001two's complement
64-bit1111111111111111111111111111111111111111111111100100011010100001two's complement
One's complement00000000000000011011100101011110at 32 bits, every bit flipped
Bits reversed10000101011000100111111111111111at 32 bits
Rotated left by 111111111111111001000110101000011at 32 bits, wrapping
Shifted left by 1-110111001010111110= -225,982, no wrap
Shifted right by 1-1101110010110000= -56,495, discarding the low bit
These bits as a double5.58249714 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-112,991 to the power 212,766,966,081
-112,991 to the power 3-1,442,552,264,458,271
-112,991 to the power 4162,995,422,913,404,498,561
-112,991 to the power 5-18,417,015,830,408,487,696,905,951
First ten multiples-112,991, -225,982, -338,973, -451,964, -564,955, -677,946, -790,937, -903,928, -1,016,919, -1,129,910
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
As a percentage & fraction
As a percentage-11,299,100%
-112,991% as a decimal-1,129.91
-112,991% of 100-112,991
-112,991% of 1,000-1,129,910
As a fraction of 100-112,991/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -112,991
Nerdulate something else
Nothing in mind? Surprise me · today’s page