Recognised as Number
-112,033
- Negative
- Odd
- 6 digits
-112,033 is an odd 6-digit integer and the negative of 112,033. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value112,033
Digit count6
Digit sum10
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 23 × 4,871
Distinct prime factors223, 4,871
Number of divisors4
Sum of divisors σ(n)116,928
SquarefreeYesno repeated prime factor
All divisors1, 23, 4,871, 112,0334 in total
Arithmetic
Representations
Decimal-112,033
Binary1101101011010000117 bits
Octal332641
Hexadecimal1B5A1
Base 362EG1
In wordsminus one hundred and twelve thousand and thirty-three
Ordinalminus one hundred and twelve thousand and thirty-third
Scientific notation-1.12033 × 10^5
Engineering notation-112.033 × 10^3
In other bases
Ternary12200200101base 3; the most digit-efficient integer base after e: 11 digits
Quinary12041113base 5; one hand: 8 digits
Septenary644425base 7: 6 digits
Nonary180611base 9; each digit is two ternary digits: 6 digits
Duodecimal54a01base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimale01dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal31:7:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1010T100T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101111110100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100100101001011111
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 set bits, so odd; 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 a1
Gray code10110111101110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100100101001011111two's complement
64-bit1111111111111111111111111111111111111111111111100100101001011111two's complement
One's complement00000000000000011011010110100000at 32 bits, every bit flipped
Bits reversed11111010010100100111111111111111at 32 bits
Rotated left by 111111111111111001001010010111111at 32 bits, wrapping
Shifted left by 1-110110101101000010= -224,066, no wrap
Shifted right by 1-1101101011010001= -56,016, discarding the low bit
These bits as a double5.53516565 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-112,033 to the power 212,551,393,089
-112,033 to the power 3-1,406,170,221,939,937
-112,033 to the power 4157,537,468,474,596,961,921
-112,033 to the power 5-17,649,395,205,614,521,434,895,393
First ten multiples-112,033, -224,066, -336,099, -448,132, -560,165, -672,198, -784,231, -896,264, -1,008,297, -1,120,330
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 33
As a percentage & fraction
As a percentage-11,203,300%
-112,033% as a decimal-1,120.33
-112,033% of 100-112,033
-112,033% of 1,000-1,120,330
As a fraction of 100-112,033/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -112,033
Nerdulate something else
Nothing in mind? Surprise me · today’s page