Recognised as Number
-137,981
- Negative
- Odd
- 6 digits
-137,981 is an odd 6-digit integer and the negative of 137,981. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value137,981
Digit count6
Digit sum29
Digit product1,512
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 31 × 4,451
Distinct prime factors231, 4,451
Number of divisors4
Sum of divisors σ(n)142,464
SquarefreeYesno repeated prime factor
All divisors1, 31, 4,451, 137,9814 in total
Arithmetic
Representations
Decimal-137,981
Binary10000110101111110118 bits
Octal415375
Hexadecimal21AFD
Base 362YGT
In wordsminus one hundred and thirty-seven thousand, nine hundred and eighty-one
Ordinalminus one hundred and thirty-seven thousand, nine hundred and eighty-first
Scientific notation-1.37981 × 10^5
Engineering notation-137.981 × 10^3
In other bases
Ternary21000021102base 3; the most digit-efficient integer base after e: 11 digits
Quinary13403411base 5; one hand: 8 digits
Septenary1113164base 7: 7 digits
Nonary230242base 9; each digit is two ternary digits: 6 digits
Duodecimal67a25base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalh4j1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal38:19:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T000T1TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010010100000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011110010100000011
Bit length18 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits7within that length
Bit parityodd11 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 1a fd
Gray code110001011110000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011110010100000011two's complement
64-bit1111111111111111111111111111111111111111111111011110010100000011two's complement
One's complement00000000000000100001101011111100at 32 bits, every bit flipped
Bits reversed11000000101001111011111111111111at 32 bits
Rotated left by 111111111111110111100101000000111at 32 bits, wrapping
Shifted left by 1-1000011010111111010= -275,962, no wrap
Shifted right by 1-10000110101111111= -68,990, discarding the low bit
These bits as a double6.81716719 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-137,981 to the power 219,038,756,361
-137,981 to the power 3-2,626,986,641,447,141
-137,981 to the power 4362,474,243,773,517,962,321
-137,981 to the power 5-50,014,558,630,113,781,959,013,901
First ten multiples-137,981, -275,962, -413,943, -551,924, -689,905, -827,886, -965,867, -1,103,848, -1,241,829, -1,379,810
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 81
As a percentage & fraction
As a percentage-13,798,100%
-137,981% as a decimal-1,379.81
-137,981% of 100-137,981
-137,981% of 1,000-1,379,810
As a fraction of 100-137,981/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -137,981
Nerdulate something else
Nothing in mind? Surprise me · today’s page