Recognised as Number
-131,107
- Negative
- Odd
- 6 digits
-131,107 is an odd 6-digit integer and the negative of 131,107. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value131,107
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 × 43 × 3,049
Distinct prime factors243, 3,049
Number of divisors4
Sum of divisors σ(n)134,200
SquarefreeYesno repeated prime factor
All divisors1, 43, 3,049, 131,1074 in total
Arithmetic
Representations
Decimal-131,107
Binary10000000000010001118 bits
Octal400043
Hexadecimal20023
Base 362T5V
In wordsminus one hundred and thirty-one thousand, one hundred and seven
Ordinalminus one hundred and thirty-one thousand, one hundred and seventh
Scientific notation-1.31107 × 10^5
Engineering notation-131.107 × 10^3
In other bases
Ternary20122211211base 3; the most digit-efficient integer base after e: 11 digits
Quinary13143412base 5; one hand: 8 digits
Septenary1054144base 7: 7 digits
Nonary218754base 9; each digit is two ternary digits: 6 digits
Duodecimal63a57base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg7f7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:25:7base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T1000111TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000000000101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111111111011101
Bit length18 bitsto write the magnitude
Set bits4the population count, or Hamming weight
Zero bits14within that length
Bit parityeven4 set bits, so even; not the same as the number itself being odd
Highest set bitbit 17worth 131,072
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes302 00 23
Gray code110000000000110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111111111011101two's complement
64-bit1111111111111111111111111111111111111111111111011111111111011101two's complement
One's complement00000000000000100000000000100010at 32 bits, every bit flipped
Bits reversed10111011111111111011111111111111at 32 bits
Rotated left by 111111111111110111111111110111011at 32 bits, wrapping
Shifted left by 1-1000000000001000110= -262,214, no wrap
Shifted right by 1-10000000000010010= -65,553, discarding the low bit
These bits as a double6.47754646 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-131,107 to the power 217,189,045,449
-131,107 to the power 3-2,253,604,181,682,043
-131,107 to the power 4295,463,283,447,787,611,601
-131,107 to the power 5-38,737,304,702,989,090,394,172,307
First ten multiples-131,107, -262,214, -393,321, -524,428, -655,535, -786,642, -917,749, -1,048,856, -1,179,963, -1,311,070
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 7
Divisible by 100No, remainder 7
As a percentage & fraction
As a percentage-13,110,700%
-131,107% as a decimal-1,311.07
-131,107% of 100-131,107
-131,107% of 1,000-1,311,070
As a fraction of 100-131,107/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -131,107
Nerdulate something else
Nothing in mind? Surprise me · today’s page