Recognised as Number
-109,745
- Negative
- Odd
- 6 digits
-109,745 is an odd 6-digit integer and the negative of 109,745. It has 8 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value109,745
Digit count6
Digit sum26
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 × 5 × 47 × 467
Distinct prime factors35, 47, 467
Number of divisors8
Sum of divisors σ(n)134,784
SquarefreeYesno repeated prime factor
All divisors1, 5, 47, 235, 467, 2,335, 21,949, 109,7458 in total
Arithmetic
Representations
Decimal-109,745
Binary1101011001011000117 bits
Octal326261
Hexadecimal1ACB1
Base 362COH
In wordsminus one hundred and nine thousand, seven hundred and forty-five
Ordinalminus one hundred and nine thousand, seven hundred and forty-fifth
Scientific notation-1.09745 × 10^5
Engineering notation-109.745 × 10^3
In other bases
Ternary12120112122base 3; the most digit-efficient integer base after e: 11 digits
Quinary12002440base 5; one hand: 8 digits
Septenary634646base 7: 6 digits
Nonary176478base 9; each digit is two ternary digits: 6 digits
Duodecimal53615base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalde75base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal30:29:5base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1011T110101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100101011101010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100101001101001111
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 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 ac b1
Gray code10111101011101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100101001101001111two's complement
64-bit1111111111111111111111111111111111111111111111100101001101001111two's complement
One's complement00000000000000011010110010110000at 32 bits, every bit flipped
Bits reversed11110010110010100111111111111111at 32 bits
Rotated left by 111111111111111001010011010011111at 32 bits, wrapping
Shifted left by 1-110101100101100010= -219,490, no wrap
Shifted right by 1-1101011001011001= -54,872, discarding the low bit
These bits as a double5.42212343 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-109,745 to the power 212,043,965,025
-109,745 to the power 3-1,321,764,941,668,625
-109,745 to the power 4145,057,093,523,423,250,625
-109,745 to the power 5-15,919,290,728,728,084,639,840,625
First ten multiples-109,745, -219,490, -329,235, -438,980, -548,725, -658,470, -768,215, -877,960, -987,705, -1,097,450
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 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 5
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 45
As a percentage & fraction
As a percentage-10,974,500%
-109,745% as a decimal-1,097.45
-109,745% of 100-109,745
-109,745% of 1,000-1,097,450
As a fraction of 100-109,745/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -109,745
Nerdulate something else
Nothing in mind? Surprise me · today’s page