Recognised as Number
-110,721
- Negative
- Odd
- 6 digits
-110,721 is an odd 6-digit integer and the negative of 110,721. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value110,721
Digit count6
Digit sum12
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 × 3 × 13 × 17 × 167
Distinct prime factors43, 13, 17, 167
Number of divisors16
Sum of divisors σ(n)169,344
SquarefreeYesno repeated prime factor
All divisors1, 3, 13, 17, 39, 51, 167, 221, 501, 663, 2,171, 2,839, 6,513, 8,517, 36,907, 110,72116 in total
Arithmetic
Representations
Decimal-110,721
Binary1101100001000000117 bits
Octal330201
Hexadecimal1B081
Base 362DFL
In wordsminus one hundred and ten thousand, seven hundred and twenty-one
Ordinalminus one hundred and ten thousand, seven hundred and twenty-first
Scientific notation-1.10721 × 10^5
Engineering notation-110.721 × 10^3
In other bases
Ternary12121212210base 3; the most digit-efficient integer base after e: 11 digits
Quinary12020341base 5; one hand: 8 digits
Septenary640542base 7: 6 digits
Nonary177783base 9; each digit is two ternary digits: 6 digits
Duodecimal540a9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaldgg1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal30:45:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT101010101T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101000010000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100100111101111111
Bit length17 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits11within that length
Bit parityeven6 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 81
Gray code10110100011000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100100111101111111two's complement
64-bit1111111111111111111111111111111111111111111111100100111101111111two's complement
One's complement00000000000000011011000010000000at 32 bits, every bit flipped
Bits reversed11111110111100100111111111111111at 32 bits
Rotated left by 111111111111111001001111011111111at 32 bits, wrapping
Shifted left by 1-110110000100000010= -221,442, no wrap
Shifted right by 1-1101100001000001= -55,360, discarding the low bit
These bits as a double5.47034424 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-110,721 to the power 212,259,139,841
-110,721 to the power 3-1,357,344,222,335,361
-110,721 to the power 4150,286,509,641,193,505,281
-110,721 to the power 5-16,639,872,633,982,586,098,217,601
First ten multiples-110,721, -221,442, -332,163, -442,884, -553,605, -664,326, -775,047, -885,768, -996,489, -1,107,210
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 9
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-11,072,100%
-110,721% as a decimal-1,107.21
-110,721% of 100-110,721
-110,721% of 1,000-1,107,210
As a fraction of 100-110,721/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -110,721
Nerdulate something else
Nothing in mind? Surprise me · today’s page