Recognised as Number
-139,367
- Negative
- Odd
- 6 digits
-139,367 is an odd 6-digit integer and the negative of 139,367. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value139,367
Digit count6
Digit sum29
Digit product3,402
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 × 139,367
Distinct prime factors1139,367
Number of divisors2
Sum of divisors σ(n)139,368
SquarefreeYesno repeated prime factor
All divisors1, 139,3672 in total
Arithmetic
Representations
Decimal-139,367
Binary10001000000110011118 bits
Octal420147
Hexadecimal22067
Base 362ZJB
In wordsminus one hundred and thirty-nine thousand, three hundred and sixty-seven
Ordinalminus one hundred and thirty-nine thousand, three hundred and sixty-seventh
Scientific notation-1.39367 × 10^5
Engineering notation-139.367 × 10^3
In other bases
Ternary21002011202base 3; the most digit-efficient integer base after e: 11 digits
Quinary13424432base 5; one hand: 8 digits
Septenary1120214base 7: 7 digits
Nonary232152base 9; each digit is two ternary digits: 6 digits
Duodecimal6879bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalh887base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal38:42:47base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T0T1T111T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010000011101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011101111110011001
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 20 67
Gray code110011000001010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011101111110011001two's complement
64-bit1111111111111111111111111111111111111111111111011101111110011001two's complement
One's complement00000000000000100010000001100110at 32 bits, every bit flipped
Bits reversed10011001111110111011111111111111at 32 bits
Rotated left by 111111111111110111011111100110011at 32 bits, wrapping
Shifted left by 1-1000100000011001110= -278,734, no wrap
Shifted right by 1-10001000000110100= -69,683, discarding the low bit
These bits as a double6.88564469 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-139,367 to the power 219,423,160,689
-139,367 to the power 3-2,706,947,635,743,863
-139,367 to the power 4377,259,171,150,714,954,721
-139,367 to the power 5-52,577,478,905,761,691,094,601,607
First ten multiples-139,367, -278,734, -418,101, -557,468, -696,835, -836,202, -975,569, -1,114,936, -1,254,303, -1,393,670
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67
As a percentage & fraction
As a percentage-13,936,700%
-139,367% as a decimal-1,393.67
-139,367% of 100-139,367
-139,367% of 1,000-1,393,670
As a fraction of 100-139,367/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -139,367
Nerdulate something else
Nothing in mind? Surprise me · today’s page