Recognised as Number
-110,741
- Negative
- Odd
- 6 digits
-110,741 is an odd 6-digit integer and the negative of 110,741. It has 8 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value110,741
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 × 37 × 41 × 73
Distinct prime factors337, 41, 73
Number of divisors8
Sum of divisors σ(n)118,104
SquarefreeYesno repeated prime factor
All divisors1, 37, 41, 73, 1,517, 2,701, 2,993, 110,7418 in total
Arithmetic
Representations
Decimal-110,741
Binary1101100001001010117 bits
Octal330225
Hexadecimal1B095
Base 362DG5
In wordsminus one hundred and ten thousand, seven hundred and forty-one
Ordinalminus one hundred and ten thousand, seven hundred and forty-first
Scientific notation-1.10741 × 10^5
Engineering notation-110.741 × 10^3
In other bases
Ternary12121220112base 3; the most digit-efficient integer base after e: 11 digits
Quinary12020431base 5; one hand: 8 digits
Septenary640601base 7: 6 digits
Nonary177815base 9; each digit is two ternary digits: 6 digits
Duodecimal54105base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaldgh1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal30:45:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1010101T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101000010111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100100111101101011
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 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 b0 95
Gray code10110100011011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100100111101101011two's complement
64-bit1111111111111111111111111111111111111111111111100100111101101011two's complement
One's complement00000000000000011011000010010100at 32 bits, every bit flipped
Bits reversed11010110111100100111111111111111at 32 bits
Rotated left by 111111111111111001001111011010111at 32 bits, wrapping
Shifted left by 1-110110000100101010= -221,482, no wrap
Shifted right by 1-1101100001001011= -55,370, discarding the low bit
These bits as a double5.47133237 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-110,741 to the power 212,263,569,081
-110,741 to the power 3-1,358,079,903,599,021
-110,741 to the power 4150,395,126,604,459,184,561
-110,741 to the power 5-16,654,906,715,304,414,557,469,701
First ten multiples-110,741, -221,482, -332,223, -442,964, -553,705, -664,446, -775,187, -885,928, -996,669, -1,107,410
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41
As a percentage & fraction
As a percentage-11,074,100%
-110,741% as a decimal-1,107.41
-110,741% of 100-110,741
-110,741% of 1,000-1,107,410
As a fraction of 100-110,741/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -110,741
Nerdulate something else
Nothing in mind? Surprise me · today’s page