Recognised as Number
-138,247
- Negative
- Odd
- 6 digits
-138,247 is an odd 6-digit integer and the negative of 138,247. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value138,247
Digit count6
Digit sum25
Digit product1,344
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 138,247
Distinct prime factors1138,247
Number of divisors2
Sum of divisors σ(n)138,248
SquarefreeYesno repeated prime factor
All divisors1, 138,2472 in total
Arithmetic
Representations
Decimal-138,247
Binary10000111000000011118 bits
Octal416007
Hexadecimal21C07
Base 362YO7
In wordsminus one hundred and thirty-eight thousand, two hundred and forty-seven
Ordinalminus one hundred and thirty-eight thousand, two hundred and forty-seventh
Scientific notation-1.38247 × 10^5
Engineering notation-138.247 × 10^3
In other bases
Ternary21000122021base 3; the most digit-efficient integer base after e: 11 digits
Quinary13410442base 5; one hand: 8 digits
Septenary1114024base 7: 7 digits
Nonary230567base 9; each digit is two ternary digits: 6 digits
Duodecimal68007base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalh5c7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal38:24:7base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T00T101T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010010000001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011110001111111001
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 07
Gray code110001001000000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011110001111111001two's complement
64-bit1111111111111111111111111111111111111111111111011110001111111001two's complement
One's complement00000000000000100001110000000110at 32 bits, every bit flipped
Bits reversed10011111110001111011111111111111at 32 bits
Rotated left by 111111111111110111100011111110011at 32 bits, wrapping
Shifted left by 1-1000011100000001110= -276,494, no wrap
Shifted right by 1-10000111000000100= -69,123, discarding the low bit
These bits as a double6.83030933 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-138,247 to the power 219,112,233,009
-138,247 to the power 3-2,642,208,876,795,223
-138,247 to the power 4365,277,450,590,309,194,081
-138,247 to the power 5-50,498,511,711,758,475,154,116,007
First ten multiples-138,247, -276,494, -414,741, -552,988, -691,235, -829,482, -967,729, -1,105,976, -1,244,223, -1,382,470
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 47
As a percentage & fraction
As a percentage-13,824,700%
-138,247% as a decimal-1,382.47
-138,247% of 100-138,247
-138,247% of 1,000-1,382,470
As a fraction of 100-138,247/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -138,247
Nerdulate something else
Nothing in mind? Surprise me · today’s page