Recognised as Number
-134,301
- Negative
- Odd
- 6 digits
-134,301 is an odd 6-digit integer and the negative of 134,301. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value134,301
Digit count6
Digit sum12
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 89 × 503
Distinct prime factors33, 89, 503
Number of divisors8
Sum of divisors σ(n)181,440
SquarefreeYesno repeated prime factor
All divisors1, 3, 89, 267, 503, 1,509, 44,767, 134,3018 in total
Arithmetic
Representations
Decimal-134,301
Binary10000011001001110118 bits
Octal406235
Hexadecimal20C9D
Base 362VML
In wordsminus one hundred and thirty-four thousand, three hundred and one
Ordinalminus one hundred and thirty-four thousand, three hundred and first
Scientific notation-1.34301 × 10^5
Engineering notation-134.301 × 10^3
In other bases
Ternary20211020010base 3; the most digit-efficient integer base after e: 11 digits
Quinary13244201base 5; one hand: 8 digits
Septenary1066356base 7: 7 digits
Nonary224203base 9; each digit is two ternary digits: 6 digits
Duodecimal65879base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalgff1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal37:18:21base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T1TTT100T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011010010100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111001101100011
Bit length18 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits10within that length
Bit parityeven8 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 0c 9d
Gray code110000101011010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111001101100011two's complement
64-bit1111111111111111111111111111111111111111111111011111001101100011two's complement
One's complement00000000000000100000110010011100at 32 bits, every bit flipped
Bits reversed11000110110011111011111111111111at 32 bits
Rotated left by 111111111111110111110011011000111at 32 bits, wrapping
Shifted left by 1-1000001100100111010= -268,602, no wrap
Shifted right by 1-10000011001001111= -67,150, discarding the low bit
These bits as a double6.63535103 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-134,301 to the power 218,036,758,601
-134,301 to the power 3-2,422,354,716,872,901
-134,301 to the power 4325,324,660,830,747,477,201
-134,301 to the power 5-43,691,427,274,230,216,935,571,501
First ten multiples-134,301, -268,602, -402,903, -537,204, -671,505, -805,806, -940,107, -1,074,408, -1,208,709, -1,343,010
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 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-13,430,100%
-134,301% as a decimal-1,343.01
-134,301% of 100-134,301
-134,301% of 1,000-1,343,010
As a fraction of 100-134,301/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -134,301
Nerdulate something else
Nothing in mind? Surprise me · today’s page