Recognised as Number
-112,073
- Negative
- Odd
- 6 digits
-112,073 is an odd 6-digit integer and the negative of 112,073. It has 8 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value112,073
Digit count6
Digit sum14
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 13 × 37 × 233
Distinct prime factors313, 37, 233
Number of divisors8
Sum of divisors σ(n)124,488
SquarefreeYesno repeated prime factor
All divisors1, 13, 37, 233, 481, 3,029, 8,621, 112,0738 in total
Arithmetic
Representations
Decimal-112,073
Binary1101101011100100117 bits
Octal332711
Hexadecimal1B5C9
Base 362EH5
In wordsminus one hundred and twelve thousand and seventy-three
Ordinalminus one hundred and twelve thousand and seventy-third
Scientific notation-1.12073 × 10^5
Engineering notation-112.073 × 10^3
In other bases
Ternary12200201212base 3; the most digit-efficient integer base after e: 11 digits
Quinary12041243base 5; one hand: 8 digits
Septenary644513base 7: 6 digits
Nonary180655base 9; each digit is two ternary digits: 6 digits
Duodecimal54a35base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimale03dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal31:7:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1010T1T1011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101111001001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100100101000110111
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 odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 b5 c9
Gray code10110111100101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100100101000110111two's complement
64-bit1111111111111111111111111111111111111111111111100100101000110111two's complement
One's complement00000000000000011011010111001000at 32 bits, every bit flipped
Bits reversed11101100010100100111111111111111at 32 bits
Rotated left by 111111111111111001001010001101111at 32 bits, wrapping
Shifted left by 1-110110101110010010= -224,146, no wrap
Shifted right by 1-1101101011100101= -56,036, discarding the low bit
These bits as a double5.53714191 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-112,073 to the power 212,560,357,329
-112,073 to the power 3-1,407,676,926,933,017
-112,073 to the power 4157,762,576,232,164,014,241
-112,073 to the power 5-17,680,925,206,067,317,568,031,593
First ten multiples-112,073, -224,146, -336,219, -448,292, -560,365, -672,438, -784,511, -896,584, -1,008,657, -1,120,730
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 73
As a percentage & fraction
As a percentage-11,207,300%
-112,073% as a decimal-1,120.73
-112,073% of 100-112,073
-112,073% of 1,000-1,120,730
As a fraction of 100-112,073/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -112,073
Nerdulate something else
Nothing in mind? Surprise me · today’s page