Recognised as Number
-109,059
- Negative
- Odd
- 6 digits
-109,059 is an odd 6-digit integer and the negative of 109,059. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value109,059
Digit count6
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 36,353
Distinct prime factors23, 36,353
Number of divisors4
Sum of divisors σ(n)145,416
SquarefreeYesno repeated prime factor
All divisors1, 3, 36,353, 109,0594 in total
Arithmetic
Representations
Decimal-109,059
Binary1101010100000001117 bits
Octal325003
Hexadecimal1AA03
Base 362C5F
In wordsminus one hundred and nine thousand and fifty-nine
Ordinalminus one hundred and nine thousand and fifty-ninth
Scientific notation-1.09059 × 10^5
Engineering notation-109.059 × 10^3
In other bases
Ternary12112121020base 3; the most digit-efficient integer base after e: 11 digits
Quinary11442214base 5; one hand: 8 digits
Septenary632646base 7: 6 digits
Nonary175536base 9; each digit is two ternary digits: 6 digits
Duodecimal53143base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaldccjbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal30:17:39base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1011011TT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010101000001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100101010111111101
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 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 aa 03
Gray code10111111100000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100101010111111101two's complement
64-bit1111111111111111111111111111111111111111111111100101010111111101two's complement
One's complement00000000000000011010101000000010at 32 bits, every bit flipped
Bits reversed10111111101010100111111111111111at 32 bits
Rotated left by 111111111111111001010101111111011at 32 bits, wrapping
Shifted left by 1-110101010000000110= -218,118, no wrap
Shifted right by 1-1101010100000010= -54,529, discarding the low bit
These bits as a double5.38823053 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-109,059 to the power 211,893,865,481
-109,059 to the power 3-1,297,133,075,492,379
-109,059 to the power 4141,464,036,080,123,361,361
-109,059 to the power 5-15,427,926,310,862,173,666,669,299
First ten multiples-109,059, -218,118, -327,177, -436,236, -545,295, -654,354, -763,413, -872,472, -981,531, -1,090,590
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 3
Divisible by 100No, remainder 59
As a percentage & fraction
As a percentage-10,905,900%
-109,059% as a decimal-1,090.59
-109,059% of 100-109,059
-109,059% of 1,000-1,090,590
As a fraction of 100-109,059/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -109,059
Nerdulate something else
Nothing in mind? Surprise me · today’s page