Recognised as Number
-137,385
- Negative
- Odd
- 6 digits
-137,385 is an odd 6-digit integer and the negative of 137,385. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value137,385
Digit count6
Digit sum27
Digit product2,520
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^2 × 5 × 43 × 71
Distinct prime factors43, 5, 43, 71
Number of divisors24
Sum of divisors σ(n)247,104
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 9, 15, 43, 45, 71, 129, 213, 215, 355, 387, 639, 645, 1,065, 1,935, 3,053, 3,195, 9,159, 15,265, 27,477, 45,795, 137,38524 in total
Arithmetic
Representations
Decimal-137,385
Binary10000110001010100118 bits
Octal414251
Hexadecimal218A9
Base 362Y09
In wordsminus one hundred and thirty-seven thousand, three hundred and eighty-five
Ordinalminus one hundred and thirty-seven thousand, three hundred and eighty-fifth
Scientific notation-1.37385 × 10^5
Engineering notation-137.385 × 10^3
In other bases
Ternary20222110100base 3; the most digit-efficient integer base after e: 11 digits
Quinary13344020base 5; one hand: 8 digits
Septenary1111353base 7: 7 digits
Nonary228410base 9; each digit is two ternary digits: 6 digits
Duodecimal67609base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalh395base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal38:9:45base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T001TT0T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011100010101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011110011101010111
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 18 a9
Gray code110001010011111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011110011101010111two's complement
64-bit1111111111111111111111111111111111111111111111011110011101010111two's complement
One's complement00000000000000100001100010101000at 32 bits, every bit flipped
Bits reversed11101010111001111011111111111111at 32 bits
Rotated left by 111111111111110111100111010101111at 32 bits, wrapping
Shifted left by 1-1000011000101010010= -274,770, no wrap
Shifted right by 1-10000110001010101= -68,692, discarding the low bit
These bits as a double6.78772088 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-137,385 to the power 218,874,638,225
-137,385 to the power 3-2,593,092,172,541,625
-137,385 to the power 4356,251,968,124,631,150,625
-137,385 to the power 5-48,943,676,640,802,450,628,615,625
First ten multiples-137,385, -274,770, -412,155, -549,540, -686,925, -824,310, -961,695, -1,099,080, -1,236,465, -1,373,850
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 1
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 6
Divisible by 12No, remainder 9
Divisible by 100No, remainder 85
As a percentage & fraction
As a percentage-13,738,500%
-137,385% as a decimal-1,373.85
-137,385% of 100-137,385
-137,385% of 1,000-1,373,850
As a fraction of 100-137,385/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -137,385
Nerdulate something else
Nothing in mind? Surprise me · today’s page