Recognised as Number
-131,415
- Negative
- Odd
- 6 digits
-131,415 is an odd 6-digit integer and the negative of 131,415. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value131,415
Digit count6
Digit sum15
Digit product60
Multiplicative persistence2times 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 × 8,761
Distinct prime factors33, 5, 8,761
Number of divisors8
Sum of divisors σ(n)210,288
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 15, 8,761, 26,283, 43,805, 131,4158 in total
Arithmetic
Representations
Decimal-131,415
Binary10000000010101011118 bits
Octal400527
Hexadecimal20157
Base 362TEF
In wordsminus one hundred and thirty-one thousand, four hundred and fifteen
Ordinalminus one hundred and thirty-one thousand, four hundred and fifteenth
Scientific notation-1.31415 × 10^5
Engineering notation-131.415 × 10^3
In other bases
Ternary20200021020base 3; the most digit-efficient integer base after e: 11 digits
Quinary13201130base 5; one hand: 8 digits
Septenary1055064base 7: 7 digits
Nonary220236base 9; each digit is two ternary digits: 6 digits
Duodecimal64073base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg8afbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:30:15base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T100T1TT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000001111111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111111010101001
Bit length18 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits11within that length
Bit parityodd7 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 01 57
Gray code110000000111111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111111010101001two's complement
64-bit1111111111111111111111111111111111111111111111011111111010101001two's complement
One's complement00000000000000100000000101010110at 32 bits, every bit flipped
Bits reversed10010101011111111011111111111111at 32 bits
Rotated left by 111111111111110111111110101010011at 32 bits, wrapping
Shifted left by 1-1000000001010101110= -262,830, no wrap
Shifted right by 1-10000000010101100= -65,707, discarding the low bit
These bits as a double6.49276368 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-131,415 to the power 217,269,902,225
-131,415 to the power 3-2,269,524,200,898,375
-131,415 to the power 4298,249,522,861,059,950,625
-131,415 to the power 5-39,194,461,046,786,193,411,384,375
First ten multiples-131,415, -262,830, -394,245, -525,660, -657,075, -788,490, -919,905, -1,051,320, -1,182,735, -1,314,150
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 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 5
Divisible by 11No, remainder 9
Divisible by 12No, remainder 3
Divisible by 100No, remainder 15
As a percentage & fraction
As a percentage-13,141,500%
-131,415% as a decimal-1,314.15
-131,415% of 100-131,415
-131,415% of 1,000-1,314,150
As a fraction of 100-131,415/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -131,415
Nerdulate something else
Nothing in mind? Surprise me · today’s page