Recognised as Number
-113,357
- Negative
- Odd
- 6 digits
-113,357 is an odd 6-digit integer and the negative of 113,357. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value113,357
Digit count6
Digit sum20
Digit product315
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 113,357
Distinct prime factors1113,357
Number of divisors2
Sum of divisors σ(n)113,358
SquarefreeYesno repeated prime factor
All divisors1, 113,3572 in total
Arithmetic
Representations
Decimal-113,357
Binary1101110101100110117 bits
Octal335315
Hexadecimal1BACD
Base 362FGT
In wordsminus one hundred and thirteen thousand, three hundred and fifty-seven
Ordinalminus one hundred and thirteen thousand, three hundred and fifty-seventh
Scientific notation-1.13357 × 10^5
Engineering notation-113.357 × 10^3
In other bases
Ternary12202111102base 3; the most digit-efficient integer base after e: 11 digits
Quinary12111412base 5; one hand: 8 digits
Septenary651326base 7: 6 digits
Nonary182442base 9; each digit is two ternary digits: 6 digits
Duodecimal55725base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimale37hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal31:29:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT101T1TTTTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100100010101110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100100010100110011
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 cd
Gray code10110011110101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100100010100110011two's complement
64-bit1111111111111111111111111111111111111111111111100100010100110011two's complement
One's complement00000000000000011011101011001100at 32 bits, every bit flipped
Bits reversed11001100101000100111111111111111at 32 bits
Rotated left by 111111111111111001000101001100111at 32 bits, wrapping
Shifted left by 1-110111010110011010= -226,714, no wrap
Shifted right by 1-1101110101100111= -56,678, discarding the low bit
These bits as a double5.60057994 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-113,357 to the power 212,849,809,449
-113,357 to the power 3-1,456,615,849,710,293
-113,357 to the power 4165,117,602,875,609,683,601
-113,357 to the power 5-18,717,236,109,170,486,903,958,557
First ten multiples-113,357, -226,714, -340,071, -453,428, -566,785, -680,142, -793,499, -906,856, -1,020,213, -1,133,570
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 57
As a percentage & fraction
As a percentage-11,335,700%
-113,357% as a decimal-1,133.57
-113,357% of 100-113,357
-113,357% of 1,000-1,133,570
As a fraction of 100-113,357/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -113,357
Nerdulate something else
Nothing in mind? Surprise me · today’s page