Recognised as Number
-131,808
- Negative
- Even
- 6 digits
-131,808 is an even 6-digit integer and the negative of 131,808. It has 24 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value131,808
Digit count6
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^5 × 3 × 1,373
Distinct prime factors32, 3, 1,373
Number of divisors24
Sum of divisors σ(n)346,248
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48, 96, 1,373, 2,746, 4,119, 5,492, 8,238, 10,984, 16,476, 21,968, 32,952, 43,936, 65,904, 131,80824 in total
Arithmetic
Representations
Decimal-131,808
Binary10000000101110000018 bits
Octal401340
Hexadecimal202E0
Base 362TPC
In wordsminus one hundred and thirty-one thousand, eight hundred and eight
Ordinalminus one hundred and thirty-one thousand, eight hundred and eighth
Scientific notation-1.31808 × 10^5
Engineering notation-131.808 × 10^3
In other bases
Ternary20200210210base 3; the most digit-efficient integer base after e: 11 digits
Quinary13204213base 5; one hand: 8 digits
Septenary1056165base 7: 7 digits
Nonary220723base 9; each digit is two ternary digits: 6 digits
Duodecimal64340base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalg9a8base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:36:48base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T10T1TT1T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000110101100000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111110100100000
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 even
Highest set bitbit 17worth 131,072
Lowest set bitbit 55 trailing zeros
Power of twoNo
Bytes302 02 e0
Gray code110000001110010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111110100100000two's complement
64-bit1111111111111111111111111111111111111111111111011111110100100000two's complement
One's complement00000000000000100000001011011111at 32 bits, every bit flipped
Bits reversed00000100101111111011111111111111at 32 bits
Rotated left by 111111111111110111111101001000001at 32 bits, wrapping
Shifted left by 1-1000000010111000000= -263,616, no wrap
Shifted right by 1-10000000101110000= -65,904, discarding the low bit
These bits as a double6.51218046 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-131,808 to the power 217,373,348,864
-131,808 to the power 3-2,289,946,367,066,112
-131,808 to the power 4301,833,250,750,250,090,496
-131,808 to the power 5-39,784,037,114,888,963,928,096,768
First ten multiples-131,808, -263,616, -395,424, -527,232, -659,040, -790,848, -922,656, -1,054,464, -1,186,272, -1,318,080
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8Yes
Divisible by 9No, remainder 3
Divisible by 10No, remainder 8
Divisible by 11No, remainder 6
Divisible by 12Yes
Divisible by 100No, remainder 8
As a percentage & fraction
As a percentage-13,180,800%
-131,808% as a decimal-1,318.08
-131,808% of 100-131,808
-131,808% of 1,000-1,318,080
As a fraction of 100-131,808/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -131,808
Nerdulate something else
Nothing in mind? Surprise me · today’s page