Recognised as Number
-107,399
- Negative
- Odd
- 6 digits
-107,399 is an odd 6-digit integer and the negative of 107,399. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value107,399
Digit count6
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 211 × 509
Distinct prime factors2211, 509
Number of divisors4
Sum of divisors σ(n)108,120
SquarefreeYesno repeated prime factor
All divisors1, 211, 509, 107,3994 in total
Arithmetic
Representations
Decimal-107,399
Binary1101000111000011117 bits
Octal321607
Hexadecimal1A387
Base 362AVB
In wordsminus one hundred and seven thousand, three hundred and ninety-nine
Ordinalminus one hundred and seven thousand, three hundred and ninety-ninth
Scientific notation-1.07399 × 10^5
Engineering notation-107.399 × 10^3
In other bases
Ternary12110022202base 3; the most digit-efficient integer base after e: 11 digits
Quinary11414044base 5; one hand: 8 digits
Septenary625055base 7: 6 digits
Nonary173282base 9; each digit is two ternary digits: 6 digits
Duodecimal5219bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimald89jbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal29:49:59base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11TT0T001T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010110110001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100101110001111001
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 a3 87
Gray code10111001001000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100101110001111001two's complement
64-bit1111111111111111111111111111111111111111111111100101110001111001two's complement
One's complement00000000000000011010001110000110at 32 bits, every bit flipped
Bits reversed10011110001110100111111111111111at 32 bits
Rotated left by 111111111111111001011100011110011at 32 bits, wrapping
Shifted left by 1-110100011100001110= -214,798, no wrap
Shifted right by 1-1101000111000100= -53,699, discarding the low bit
These bits as a double5.30621563 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-107,399 to the power 211,534,545,201
-107,399 to the power 3-1,238,798,620,042,199
-107,399 to the power 4133,045,732,993,912,130,401
-107,399 to the power 5-14,288,978,677,813,168,892,936,999
First ten multiples-107,399, -214,798, -322,197, -429,596, -536,995, -644,394, -751,793, -859,192, -966,591, -1,073,990
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 99
As a percentage & fraction
As a percentage-10,739,900%
-107,399% as a decimal-1,073.99
-107,399% of 100-107,399
-107,399% of 1,000-1,073,990
As a fraction of 100-107,399/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -107,399
Nerdulate something else
Nothing in mind? Surprise me · today’s page