Recognised as Number
-101,727
- Negative
- Odd
- 6 digits
-101,727 is an odd 6-digit integer and the negative of 101,727. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value101,727
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^2 × 89 × 127
Distinct prime factors33, 89, 127
Number of divisors12
Sum of divisors σ(n)149,760
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 89, 127, 267, 381, 801, 1,143, 11,303, 33,909, 101,72712 in total
Arithmetic
Representations
Decimal-101,727
Binary1100011010101111117 bits
Octal306537
Hexadecimal18D5F
Base 3626HR
In wordsminus one hundred and one thousand, seven hundred and twenty-seven
Ordinalminus one hundred and one thousand, seven hundred and twenty-seventh
Scientific notation-1.01727 × 10^5
Engineering notation-101.727 × 10^3
In other bases
Ternary12011112200base 3; the most digit-efficient integer base after e: 11 digits
Quinary11223402base 5; one hand: 8 digits
Septenary602403base 7: 6 digits
Nonary164480base 9; each digit is two ternary digits: 6 digits
Duodecimal4aa53base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalce67base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal28:15:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11T11110100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111011011111100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100111001010100001
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 8d 5f
Gray code10100101111110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100111001010100001two's complement
64-bit1111111111111111111111111111111111111111111111100111001010100001two's complement
One's complement00000000000000011000110101011110at 32 bits, every bit flipped
Bits reversed10000101010011100111111111111111at 32 bits
Rotated left by 111111111111111001110010101000011at 32 bits, wrapping
Shifted left by 1-110001101010111110= -203,454, no wrap
Shifted right by 1-1100011010110000= -50,863, discarding the low bit
These bits as a double5.0259816 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-101,727 to the power 210,348,382,529
-101,727 to the power 3-1,052,709,909,527,583
-101,727 to the power 4107,089,020,966,512,435,841
-101,727 to the power 5-10,893,844,835,860,410,560,797,407
First ten multiples-101,727, -203,454, -305,181, -406,908, -508,635, -610,362, -712,089, -813,816, -915,543, -1,017,270
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 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 27
As a percentage & fraction
As a percentage-10,172,700%
-101,727% as a decimal-1,017.27
-101,727% of 100-101,727
-101,727% of 1,000-1,017,270
As a fraction of 100-101,727/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -101,727
Nerdulate something else
Nothing in mind? Surprise me · today’s page