Recognised as Number
-134,393
- Negative
- Odd
- 6 digits
-134,393 is an odd 6-digit integer and the negative of 134,393. It has 8 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value134,393
Digit count6
Digit sum23
Digit product972
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 7 × 73 × 263
Distinct prime factors37, 73, 263
Number of divisors8
Sum of divisors σ(n)156,288
SquarefreeYesno repeated prime factor
All divisors1, 7, 73, 263, 511, 1,841, 19,199, 134,3938 in total
Arithmetic
Representations
Decimal-134,393
Binary10000011001111100118 bits
Octal406371
Hexadecimal20CF9
Base 362VP5
In wordsminus one hundred and thirty-four thousand, three hundred and ninety-three
Ordinalminus one hundred and thirty-four thousand, three hundred and ninety-third
Scientific notation-1.34393 × 10^5
Engineering notation-134.393 × 10^3
In other bases
Ternary20211100112base 3; the most digit-efficient integer base after e: 11 digits
Quinary13300033base 5; one hand: 8 digits
Septenary1066550base 7: 7 digits
Nonary224315base 9; each digit is two ternary digits: 6 digits
Duodecimal65935base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalgfjdbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal37:19:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T1TTT0T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011011100011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111001100000111
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 0c f9
Gray code110000101010000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111001100000111two's complement
64-bit1111111111111111111111111111111111111111111111011111001100000111two's complement
One's complement00000000000000100000110011111000at 32 bits, every bit flipped
Bits reversed11100000110011111011111111111111at 32 bits
Rotated left by 111111111111110111110011000001111at 32 bits, wrapping
Shifted left by 1-1000001100111110010= -268,786, no wrap
Shifted right by 1-10000011001111101= -67,196, discarding the low bit
These bits as a double6.63989643 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-134,393 to the power 218,061,478,449
-134,393 to the power 3-2,427,336,273,196,457
-134,393 to the power 4326,217,003,763,691,445,601
-134,393 to the power 5-43,841,281,786,813,784,448,655,193
First ten multiples-134,393, -268,786, -403,179, -537,572, -671,965, -806,358, -940,751, -1,075,144, -1,209,537, -1,343,930
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 93
As a percentage & fraction
As a percentage-13,439,300%
-134,393% as a decimal-1,343.93
-134,393% of 100-134,393
-134,393% of 1,000-1,343,930
As a fraction of 100-134,393/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -134,393
Nerdulate something else
Nothing in mind? Surprise me · today’s page