Recognised as Number
-130,711
- Negative
- Odd
- 6 digits
-130,711 is an odd 6-digit integer and the negative of 130,711. It has 8 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value130,711
Digit count6
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 7 × 71 × 263
Distinct prime factors37, 71, 263
Number of divisors8
Sum of divisors σ(n)152,064
SquarefreeYesno repeated prime factor
All divisors1, 7, 71, 263, 497, 1,841, 18,673, 130,7118 in total
Arithmetic
Representations
Decimal-130,711
Binary1111111101001011117 bits
Octal377227
Hexadecimal1FE97
Base 362SUV
In wordsminus one hundred and thirty thousand, seven hundred and eleven
Ordinalminus one hundred and thirty thousand, seven hundred and eleventh
Scientific notation-1.30711 × 10^5
Engineering notation-130.711 × 10^3
In other bases
Ternary20122022011base 3; the most digit-efficient integer base after e: 11 digits
Quinary13140321base 5; one hand: 8 digits
Septenary1053040base 7: 7 digits
Nonary218264base 9; each digit is two ternary digits: 6 digits
Duodecimal63787base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg6fbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:18:31base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T101T010TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000011010111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100000000101101001
Bit length17 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits4within that length
Bit parityodd13 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 fe 97
Gray code10000000111011100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100000000101101001two's complement
64-bit1111111111111111111111111111111111111111111111100000000101101001two's complement
One's complement00000000000000011111111010010110at 32 bits, every bit flipped
Bits reversed10010110100000000111111111111111at 32 bits
Rotated left by 111111111111111000000001011010011at 32 bits, wrapping
Shifted left by 1-111111110100101110= -261,422, no wrap
Shifted right by 1-1111111101001100= -65,355, discarding the low bit
These bits as a double6.45798146 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-130,711 to the power 217,085,365,521
-130,711 to the power 3-2,233,245,212,615,431
-130,711 to the power 4291,909,714,986,175,601,441
-130,711 to the power 5-38,155,810,755,557,999,039,954,551
First ten multiples-130,711, -261,422, -392,133, -522,844, -653,555, -784,266, -914,977, -1,045,688, -1,176,399, -1,307,110
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 11
As a percentage & fraction
As a percentage-13,071,100%
-130,711% as a decimal-1,307.11
-130,711% of 100-130,711
-130,711% of 1,000-1,307,110
As a fraction of 100-130,711/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -130,711
Nerdulate something else
Nothing in mind? Surprise me · today’s page