Recognised as Number
-134,127
- Negative
- Odd
- 6 digits
-134,127 is an odd 6-digit integer and the negative of 134,127. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value134,127
Digit count6
Digit sum18
Digit product168
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^2 × 7 × 2,129
Distinct prime factors33, 7, 2,129
Number of divisors12
Sum of divisors σ(n)221,520
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 63, 2,129, 6,387, 14,903, 19,161, 44,709, 134,12712 in total
Arithmetic
Representations
Decimal-134,127
Binary10000010111110111118 bits
Octal405757
Hexadecimal20BEF
Base 362VHR
In wordsminus one hundred and thirty-four thousand, one hundred and twenty-seven
Ordinalminus one hundred and thirty-four thousand, one hundred and twenty-seventh
Scientific notation-1.34127 × 10^5
Engineering notation-134.127 × 10^3
In other bases
Ternary20210222200base 3; the most digit-efficient integer base after e: 11 digits
Quinary13243002base 5; one hand: 8 digits
Septenary1066020base 7: 7 digits
Nonary223880base 9; each digit is two ternary digits: 6 digits
Duodecimal65753base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalgf67base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal37:15:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T1TT000100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011010000010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111010000010001
Bit length18 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits7within that length
Bit parityodd11 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 0b ef
Gray code110000111000011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111010000010001two's complement
64-bit1111111111111111111111111111111111111111111111011111010000010001two's complement
One's complement00000000000000100000101111101110at 32 bits, every bit flipped
Bits reversed10001000001011111011111111111111at 32 bits
Rotated left by 111111111111110111110100000100011at 32 bits, wrapping
Shifted left by 1-1000001011111011110= -268,254, no wrap
Shifted right by 1-10000010111111000= -67,063, discarding the low bit
These bits as a double6.62675429 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-134,127 to the power 217,990,052,129
-134,127 to the power 3-2,412,951,721,906,383
-134,127 to the power 4323,641,975,604,137,432,641
-134,127 to the power 5-43,409,127,261,856,141,427,839,407
First ten multiples-134,127, -268,254, -402,381, -536,508, -670,635, -804,762, -938,889, -1,073,016, -1,207,143, -1,341,270
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 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 3
Divisible by 100No, remainder 27
As a percentage & fraction
As a percentage-13,412,700%
-134,127% as a decimal-1,341.27
-134,127% of 100-134,127
-134,127% of 1,000-1,341,270
As a fraction of 100-134,127/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -134,127
Nerdulate something else
Nothing in mind? Surprise me · today’s page