Recognised as Number
-138,337
- Negative
- Odd
- 6 digits
-138,337 is an odd 6-digit integer and the negative of 138,337. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value138,337
Digit count6
Digit sum25
Digit product1,512
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 138,337
Distinct prime factors1138,337
Number of divisors2
Sum of divisors σ(n)138,338
SquarefreeYesno repeated prime factor
All divisors1, 138,3372 in total
Arithmetic
Representations
Decimal-138,337
Binary10000111000110000118 bits
Octal416141
Hexadecimal21C61
Base 362YQP
In wordsminus one hundred and thirty-eight thousand, three hundred and thirty-seven
Ordinalminus one hundred and thirty-eight thousand, three hundred and thirty-seventh
Scientific notation-1.38337 × 10^5
Engineering notation-138.337 × 10^3
In other bases
Ternary21000202121base 3; the most digit-efficient integer base after e: 11 digits
Quinary13411322base 5; one hand: 8 digits
Septenary1114213base 7: 7 digits
Nonary230677base 9; each digit is two ternary digits: 6 digits
Duodecimal68081base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalh5ghbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal38:25:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T00T1T011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010010011100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011110001110011111
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 1c 61
Gray code110001001001010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011110001110011111two's complement
64-bit1111111111111111111111111111111111111111111111011110001110011111two's complement
One's complement00000000000000100001110001100000at 32 bits, every bit flipped
Bits reversed11111001110001111011111111111111at 32 bits
Rotated left by 111111111111110111100011100111111at 32 bits, wrapping
Shifted left by 1-1000011100011000010= -276,674, no wrap
Shifted right by 1-10000111000110001= -69,168, discarding the low bit
These bits as a double6.83475592 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-138,337 to the power 219,137,125,569
-138,337 to the power 3-2,647,372,539,838,753
-138,337 to the power 4366,229,575,043,673,573,761
-138,337 to the power 5-50,663,100,722,816,671,173,375,457
First ten multiples-138,337, -276,674, -415,011, -553,348, -691,685, -830,022, -968,359, -1,106,696, -1,245,033, -1,383,370
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
As a percentage & fraction
As a percentage-13,833,700%
-138,337% as a decimal-1,383.37
-138,337% of 100-138,337
-138,337% of 1,000-1,383,370
As a fraction of 100-138,337/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -138,337
Nerdulate something else
Nothing in mind? Surprise me · today’s page