Recognised as Number
-107,261
- Negative
- Odd
- 6 digits
-107,261 is an odd 6-digit integer and the negative of 107,261. It has 12 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value107,261
Digit count6
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 7^2 × 11 × 199
Distinct prime factors37, 11, 199
Number of divisors12
Sum of divisors σ(n)136,800
SquarefreeNohas a repeated prime factor
All divisors1, 7, 11, 49, 77, 199, 539, 1,393, 2,189, 9,751, 15,323, 107,26112 in total
Arithmetic
Representations
Decimal-107,261
Binary1101000101111110117 bits
Octal321375
Hexadecimal1A2FD
Base 362ARH
In wordsminus one hundred and seven thousand, two hundred and sixty-one
Ordinalminus one hundred and seven thousand, two hundred and sixty-first
Scientific notation-1.07261 × 10^5
Engineering notation-107.261 × 10^3
In other bases
Ternary12110010122base 3; the most digit-efficient integer base after e: 11 digits
Quinary11413021base 5; one hand: 8 digits
Septenary624500base 7: 6 digits
Nonary173118base 9; each digit is two ternary digits: 6 digits
Duodecimal520a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimald831base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal29:47:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11TT00TT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010110100000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100101110100000011
Bit length17 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits6within that length
Bit parityodd11 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 a2 fd
Gray code10111001110000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100101110100000011two's complement
64-bit1111111111111111111111111111111111111111111111100101110100000011two's complement
One's complement00000000000000011010001011111100at 32 bits, every bit flipped
Bits reversed11000000101110100111111111111111at 32 bits
Rotated left by 111111111111111001011101000000111at 32 bits, wrapping
Shifted left by 1-110100010111111010= -214,522, no wrap
Shifted right by 1-1101000101111111= -53,630, discarding the low bit
These bits as a double5.29939752 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-107,261 to the power 211,504,922,121
-107,261 to the power 3-1,234,029,451,620,581
-107,261 to the power 4132,363,233,010,275,138,641
-107,261 to the power 5-14,197,412,735,915,121,645,772,301
First ten multiples-107,261, -214,522, -321,783, -429,044, -536,305, -643,566, -750,827, -858,088, -965,349, -1,072,610
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 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61
As a percentage & fraction
As a percentage-10,726,100%
-107,261% as a decimal-1,072.61
-107,261% of 100-107,261
-107,261% of 1,000-1,072,610
As a fraction of 100-107,261/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -107,261
Nerdulate something else
Nothing in mind? Surprise me · today’s page