Recognised as Number
-131,413
- Negative
- Odd
- 6 digits
-131,413 is an odd 6-digit integer and the negative of 131,413. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value131,413
Digit count6
Digit sum13
Digit product36
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 131,413
Distinct prime factors1131,413
Number of divisors2
Sum of divisors σ(n)131,414
SquarefreeYesno repeated prime factor
All divisors1, 131,4132 in total
Arithmetic
Representations
Decimal-131,413
Binary10000000010101010118 bits
Octal400525
Hexadecimal20155
Base 362TED
In wordsminus one hundred and thirty-one thousand, four hundred and thirteen
Ordinalminus one hundred and thirty-one thousand, four hundred and thirteenth
Scientific notation-1.31413 × 10^5
Engineering notation-131.413 × 10^3
In other bases
Ternary20200021011base 3; the most digit-efficient integer base after e: 11 digits
Quinary13201123base 5; one hand: 8 digits
Septenary1055062base 7: 7 digits
Nonary220234base 9; each digit is two ternary digits: 6 digits
Duodecimal64071base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg8adbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:30:13base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T100T1T0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000001111111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111111010101011
Bit length18 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits12within that length
Bit parityeven6 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 01 55
Gray code110000000111111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111111010101011two's complement
64-bit1111111111111111111111111111111111111111111111011111111010101011two's complement
One's complement00000000000000100000000101010100at 32 bits, every bit flipped
Bits reversed11010101011111111011111111111111at 32 bits
Rotated left by 111111111111110111111110101010111at 32 bits, wrapping
Shifted left by 1-1000000001010101010= -262,826, no wrap
Shifted right by 1-10000000010101011= -65,706, discarding the low bit
These bits as a double6.49266487 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-131,413 to the power 217,269,376,569
-131,413 to the power 3-2,269,420,583,061,997
-131,413 to the power 4298,231,367,081,926,211,761
-131,413 to the power 5-39,191,478,642,337,169,266,148,293
First ten multiples-131,413, -262,826, -394,239, -525,652, -657,065, -788,478, -919,891, -1,051,304, -1,182,717, -1,314,130
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
As a percentage & fraction
As a percentage-13,141,300%
-131,413% as a decimal-1,314.13
-131,413% of 100-131,413
-131,413% of 1,000-1,314,130
As a fraction of 100-131,413/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -131,413
Nerdulate something else
Nothing in mind? Surprise me · today’s page