Recognised as Number
-107,271
- Negative
- Odd
- 6 digits
-107,271 is an odd 6-digit integer and the negative of 107,271. It has 16 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value107,271
Digit count6
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^3 × 29 × 137
Distinct prime factors33, 29, 137
Number of divisors16
Sum of divisors σ(n)165,600
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 29, 87, 137, 261, 411, 783, 1,233, 3,699, 3,973, 11,919, 35,757, 107,27116 in total
Arithmetic
Representations
Decimal-107,271
Binary1101000110000011117 bits
Octal321407
Hexadecimal1A307
Base 362ARR
In wordsminus one hundred and seven thousand, two hundred and seventy-one
Ordinalminus one hundred and seven thousand, two hundred and seventy-first
Scientific notation-1.07271 × 10^5
Engineering notation-107.271 × 10^3
In other bases
Ternary12110011000base 3; the most digit-efficient integer base after e: 11 digits
Quinary11413041base 5; one hand: 8 digits
Septenary624513base 7: 6 digits
Nonary173130base 9; each digit is two ternary digits: 6 digits
Duodecimal520b3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimald83bbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal29:47:51base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11TT00TT000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010110100001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100101110011111001
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 a3 07
Gray code10111001010000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100101110011111001two's complement
64-bit1111111111111111111111111111111111111111111111100101110011111001two's complement
One's complement00000000000000011010001100000110at 32 bits, every bit flipped
Bits reversed10011111001110100111111111111111at 32 bits
Rotated left by 111111111111111001011100111110011at 32 bits, wrapping
Shifted left by 1-110100011000001110= -214,542, no wrap
Shifted right by 1-1101000110000100= -53,635, discarding the low bit
These bits as a double5.29989159 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-107,271 to the power 211,507,067,441
-107,271 to the power 3-1,234,374,631,463,511
-107,271 to the power 4132,412,601,091,722,288,481
-107,271 to the power 5-14,204,032,131,710,141,607,645,351
First ten multiples-107,271, -214,542, -321,813, -429,084, -536,355, -643,626, -750,897, -858,168, -965,439, -1,072,710
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
As a percentage & fraction
As a percentage-10,727,100%
-107,271% as a decimal-1,072.71
-107,271% of 100-107,271
-107,271% of 1,000-1,072,710
As a fraction of 100-107,271/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -107,271
Nerdulate something else
Nothing in mind? Surprise me · today’s page