Recognised as Number
-134,967
- Negative
- Odd
- 6 digits
-134,967 is an odd 6-digit integer and the negative of 134,967. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value134,967
Digit count6
Digit sum30
Digit product4,536
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 7 × 6,427
Distinct prime factors33, 7, 6,427
Number of divisors8
Sum of divisors σ(n)205,696
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 6,427, 19,281, 44,989, 134,9678 in total
Arithmetic
Representations
Decimal-134,967
Binary10000011110011011118 bits
Octal407467
Hexadecimal20F37
Base 362W53
In wordsminus one hundred and thirty-four thousand, nine hundred and sixty-seven
Ordinalminus one hundred and thirty-four thousand, nine hundred and sixty-seventh
Scientific notation-1.34967 × 10^5
Engineering notation-134.967 × 10^3
In other bases
Ternary20212010210base 3; the most digit-efficient integer base after e: 11 digits
Quinary13304332base 5; one hand: 8 digits
Septenary1101330base 7: 7 digits
Nonary225123base 9; each digit is two ternary digits: 6 digits
Duodecimal66133base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalgh87base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal37:29:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T0110TT1T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011000111011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111000011001001
Bit length18 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits8within that length
Bit parityeven10 set bits, so even; 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 0f 37
Gray code110000100010101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111000011001001two's complement
64-bit1111111111111111111111111111111111111111111111011111000011001001two's complement
One's complement00000000000000100000111100110110at 32 bits, every bit flipped
Bits reversed10010011000011111011111111111111at 32 bits
Rotated left by 111111111111110111110000110010011at 32 bits, wrapping
Shifted left by 1-1000001111001101110= -269,934, no wrap
Shifted right by 1-10000011110011100= -67,483, discarding the low bit
These bits as a double6.6682558 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-134,967 to the power 218,216,091,089
-134,967 to the power 3-2,458,571,166,009,063
-134,967 to the power 4331,825,974,562,745,205,921
-134,967 to the power 5-44,785,556,308,810,032,207,539,607
First ten multiples-134,967, -269,934, -404,901, -539,868, -674,835, -809,802, -944,769, -1,079,736, -1,214,703, -1,349,670
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 3
Divisible by 100No, remainder 67
As a percentage & fraction
As a percentage-13,496,700%
-134,967% as a decimal-1,349.67
-134,967% of 100-134,967
-134,967% of 1,000-1,349,670
As a fraction of 100-134,967/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -134,967
Nerdulate something else
Nothing in mind? Surprise me · today’s page