Recognised as Number
-134,121
- Negative
- Odd
- 6 digits
-134,121 is an odd 6-digit integer and the negative of 134,121. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value134,121
Digit count6
Digit sum12
Digit product24
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 13 × 19 × 181
Distinct prime factors43, 13, 19, 181
Number of divisors16
Sum of divisors σ(n)203,840
SquarefreeYesno repeated prime factor
All divisors1, 3, 13, 19, 39, 57, 181, 247, 543, 741, 2,353, 3,439, 7,059, 10,317, 44,707, 134,12116 in total
Arithmetic
Representations
Decimal-134,121
Binary10000010111110100118 bits
Octal405751
Hexadecimal20BE9
Base 362VHL
In wordsminus one hundred and thirty-four thousand, one hundred and twenty-one
Ordinalminus one hundred and thirty-four thousand, one hundred and twenty-first
Scientific notation-1.34121 × 10^5
Engineering notation-134.121 × 10^3
In other bases
Ternary20210222110base 3; the most digit-efficient integer base after e: 11 digits
Quinary13242441base 5; one hand: 8 digits
Septenary1066011base 7: 7 digits
Nonary223873base 9; each digit is two ternary digits: 6 digits
Duodecimal65749base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalgf61base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal37:15:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T1TT001TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011010001101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111010000010111
Bit length18 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits9within that length
Bit parityodd9 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 e9
Gray code110000111000011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111010000010111two's complement
64-bit1111111111111111111111111111111111111111111111011111010000010111two's complement
One's complement00000000000000100000101111101000at 32 bits, every bit flipped
Bits reversed11101000001011111011111111111111at 32 bits
Rotated left by 111111111111110111110100000101111at 32 bits, wrapping
Shifted left by 1-1000001011111010010= -268,242, no wrap
Shifted right by 1-10000010111110101= -67,060, discarding the low bit
These bits as a double6.62645785 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-134,121 to the power 217,988,442,641
-134,121 to the power 3-2,412,627,915,453,561
-134,121 to the power 4323,584,068,648,547,054,881
-134,121 to the power 5-43,399,418,871,211,779,547,694,601
First ten multiples-134,121, -268,242, -402,363, -536,484, -670,605, -804,726, -938,847, -1,072,968, -1,207,089, -1,341,210
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 21
As a percentage & fraction
As a percentage-13,412,100%
-134,121% as a decimal-1,341.21
-134,121% of 100-134,121
-134,121% of 1,000-1,341,210
As a fraction of 100-134,121/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -134,121
Nerdulate something else
Nothing in mind? Surprise me · today’s page