Recognised as Number
-113,309
- Negative
- Odd
- 6 digits
-113,309 is an odd 6-digit integer and the negative of 113,309. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value113,309
Digit count6
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 7 × 16,187
Distinct prime factors27, 16,187
Number of divisors4
Sum of divisors σ(n)129,504
SquarefreeYesno repeated prime factor
All divisors1, 7, 16,187, 113,3094 in total
Arithmetic
Representations
Decimal-113,309
Binary1101110101001110117 bits
Octal335235
Hexadecimal1BA9D
Base 362FFH
In wordsminus one hundred and thirteen thousand, three hundred and nine
Ordinalminus one hundred and thirteen thousand, three hundred and ninth
Scientific notation-1.13309 × 10^5
Engineering notation-113.309 × 10^3
In other bases
Ternary12202102122base 3; the most digit-efficient integer base after e: 11 digits
Quinary12111214base 5; one hand: 8 digits
Septenary651230base 7: 6 digits
Nonary182378base 9; each digit is two ternary digits: 6 digits
Duodecimal556a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimale359base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal31:28:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT101T1TT0101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101101010100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100100010101100011
Bit length17 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits6within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 ba 9d
Gray code10110011111010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100100010101100011two's complement
64-bit1111111111111111111111111111111111111111111111100100010101100011two's complement
One's complement00000000000000011011101010011100at 32 bits, every bit flipped
Bits reversed11000110101000100111111111111111at 32 bits
Rotated left by 111111111111111001000101011000111at 32 bits, wrapping
Shifted left by 1-110111010100111010= -226,618, no wrap
Shifted right by 1-1101110101001111= -56,654, discarding the low bit
These bits as a double5.59820843 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-113,309 to the power 212,838,929,481
-113,309 to the power 3-1,454,766,260,562,629
-113,309 to the power 4164,838,110,218,090,929,361
-113,309 to the power 5-18,677,641,430,701,665,114,965,549
First ten multiples-113,309, -226,618, -339,927, -453,236, -566,545, -679,854, -793,163, -906,472, -1,019,781, -1,133,090
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 9
As a percentage & fraction
As a percentage-11,330,900%
-113,309% as a decimal-1,133.09
-113,309% of 100-113,309
-113,309% of 1,000-1,133,090
As a fraction of 100-113,309/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -113,309
Nerdulate something else
Nothing in mind? Surprise me · today’s page