Recognised as Number
-109,061
- Negative
- Odd
- 6 digits
-109,061 is an odd 6-digit integer and the negative of 109,061. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value109,061
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 × 191 × 571
Distinct prime factors2191, 571
Number of divisors4
Sum of divisors σ(n)109,824
SquarefreeYesno repeated prime factor
All divisors1, 191, 571, 109,0614 in total
Arithmetic
Representations
Decimal-109,061
Binary1101010100000010117 bits
Octal325005
Hexadecimal1AA05
Base 362C5H
In wordsminus one hundred and nine thousand and sixty-one
Ordinalminus one hundred and nine thousand and sixty-first
Scientific notation-1.09061 × 10^5
Engineering notation-109.061 × 10^3
In other bases
Ternary12112121022base 3; the most digit-efficient integer base after e: 11 digits
Quinary11442221base 5; one hand: 8 digits
Septenary632651base 7: 6 digits
Nonary175538base 9; each digit is two ternary digits: 6 digits
Duodecimal53145base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaldcd1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal30:17:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1011011TT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010101000001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100101010111111011
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 05
Gray code10111111100000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100101010111111011two's complement
64-bit1111111111111111111111111111111111111111111111100101010111111011two's complement
One's complement00000000000000011010101000000100at 32 bits, every bit flipped
Bits reversed11011111101010100111111111111111at 32 bits
Rotated left by 111111111111111001010101111110111at 32 bits, wrapping
Shifted left by 1-110101010000001010= -218,122, no wrap
Shifted right by 1-1101010100000011= -54,530, discarding the low bit
These bits as a double5.38832934 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-109,061 to the power 211,894,301,721
-109,061 to the power 3-1,297,204,439,993,981
-109,061 to the power 4141,474,413,430,183,561,841
-109,061 to the power 5-15,429,341,003,109,249,437,941,301
First ten multiples-109,061, -218,122, -327,183, -436,244, -545,305, -654,366, -763,427, -872,488, -981,549, -1,090,610
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61
As a percentage & fraction
As a percentage-10,906,100%
-109,061% as a decimal-1,090.61
-109,061% of 100-109,061
-109,061% of 1,000-1,090,610
As a fraction of 100-109,061/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -109,061
Nerdulate something else
Nothing in mind? Surprise me · today’s page