Recognised as Number
-131,595
- Negative
- Odd
- 6 digits
-131,595 is an odd 6-digit integer and the negative of 131,595. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value131,595
Digit count6
Digit sum24
Digit product675
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 5 × 31 × 283
Distinct prime factors43, 5, 31, 283
Number of divisors16
Sum of divisors σ(n)218,112
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 15, 31, 93, 155, 283, 465, 849, 1,415, 4,245, 8,773, 26,319, 43,865, 131,59516 in total
Arithmetic
Representations
Decimal-131,595
Binary10000000100000101118 bits
Octal401013
Hexadecimal2020B
Base 362TJF
In wordsminus one hundred and thirty-one thousand, five hundred and ninety-five
Ordinalminus one hundred and thirty-one thousand, five hundred and ninety-fifth
Scientific notation-1.31595 × 10^5
Engineering notation-131.595 × 10^3
In other bases
Ternary20200111220base 3; the most digit-efficient integer base after e: 11 digits
Quinary13202340base 5; one hand: 8 digits
Septenary1055442base 7: 7 digits
Nonary220456base 9; each digit is two ternary digits: 6 digits
Duodecimal641a3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg8jfbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:33:15base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T10T111010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000001000110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111110111110101
Bit length18 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits13within that length
Bit parityodd5 set bits, so odd; 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 02 0b
Gray code110000001100001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111110111110101two's complement
64-bit1111111111111111111111111111111111111111111111011111110111110101two's complement
One's complement00000000000000100000001000001010at 32 bits, every bit flipped
Bits reversed10101111101111111011111111111111at 32 bits
Rotated left by 111111111111110111111101111101011at 32 bits, wrapping
Shifted left by 1-1000000010000010110= -263,190, no wrap
Shifted right by 1-10000000100000110= -65,797, discarding the low bit
These bits as a double6.50165687 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-131,595 to the power 217,317,244,025
-131,595 to the power 3-2,278,862,727,469,875
-131,595 to the power 4299,886,940,621,398,200,625
-131,595 to the power 5-39,463,621,951,072,896,211,246,875
First ten multiples-131,595, -263,190, -394,785, -526,380, -657,975, -789,570, -921,165, -1,052,760, -1,184,355, -1,315,950
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 5
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 95
As a percentage & fraction
As a percentage-13,159,500%
-131,595% as a decimal-1,315.95
-131,595% of 100-131,595
-131,595% of 1,000-1,315,950
As a fraction of 100-131,595/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -131,595
Nerdulate something else
Nothing in mind? Surprise me · today’s page