Recognised as Number
-138,251
- Negative
- Odd
- 6 digits
-138,251 is an odd 6-digit integer and the negative of 138,251. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value138,251
Digit count6
Digit sum20
Digit product240
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 138,251
Distinct prime factors1138,251
Number of divisors2
Sum of divisors σ(n)138,252
SquarefreeYesno repeated prime factor
All divisors1, 138,2512 in total
Arithmetic
Representations
Decimal-138,251
Binary10000111000000101118 bits
Octal416013
Hexadecimal21C0B
Base 362YOB
In wordsminus one hundred and thirty-eight thousand, two hundred and fifty-one
Ordinalminus one hundred and thirty-eight thousand, two hundred and fifty-first
Scientific notation-1.38251 × 10^5
Engineering notation-138.251 × 10^3
In other bases
Ternary21000122102base 3; the most digit-efficient integer base after e: 11 digits
Quinary13411001base 5; one hand: 8 digits
Septenary1114031base 7: 7 digits
Nonary230572base 9; each digit is two ternary digits: 6 digits
Duodecimal6800bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalh5cbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal38:24:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T00T101TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010010000110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011110001111110101
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 0b
Gray code110001001000001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011110001111110101two's complement
64-bit1111111111111111111111111111111111111111111111011110001111110101two's complement
One's complement00000000000000100001110000001010at 32 bits, every bit flipped
Bits reversed10101111110001111011111111111111at 32 bits
Rotated left by 111111111111110111100011111101011at 32 bits, wrapping
Shifted left by 1-1000011100000010110= -276,502, no wrap
Shifted right by 1-10000111000000110= -69,125, discarding the low bit
These bits as a double6.83050696 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-138,251 to the power 219,113,339,001
-138,251 to the power 3-2,642,438,230,227,251
-138,251 to the power 4365,319,727,767,147,678,001
-138,251 to the power 5-50,505,817,683,535,933,631,316,251
First ten multiples-138,251, -276,502, -414,753, -553,004, -691,255, -829,506, -967,757, -1,106,008, -1,244,259, -1,382,510
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 51
As a percentage & fraction
As a percentage-13,825,100%
-138,251% as a decimal-1,382.51
-138,251% of 100-138,251
-138,251% of 1,000-1,382,510
As a fraction of 100-138,251/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -138,251
Nerdulate something else
Nothing in mind? Surprise me · today’s page