Recognised as Number
-108,237
- Negative
- Odd
- 6 digits
-108,237 is an odd 6-digit integer and the negative of 108,237. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value108,237
Digit count6
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 109 × 331
Distinct prime factors33, 109, 331
Number of divisors8
Sum of divisors σ(n)146,080
SquarefreeYesno repeated prime factor
All divisors1, 3, 109, 327, 331, 993, 36,079, 108,2378 in total
Arithmetic
Representations
Decimal-108,237
Binary1101001101100110117 bits
Octal323315
Hexadecimal1A6CD
Base 362BIL
In wordsminus one hundred and eight thousand, two hundred and thirty-seven
Ordinalminus one hundred and eight thousand, two hundred and thirty-seventh
Scientific notation-1.08237 × 10^5
Engineering notation-108.237 × 10^3
In other bases
Ternary12111110210base 3; the most digit-efficient integer base after e: 11 digits
Quinary11430422base 5; one hand: 8 digits
Septenary630363base 7: 6 digits
Nonary174423base 9; each digit is two ternary digits: 6 digits
Duodecimal52779base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaldabhbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal30:3:57base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11TTTTTT1T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111010100101110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100101100100110011
Bit length17 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits7within that length
Bit parityeven10 set bits, so even; 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 a6 cd
Gray code10111010110101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100101100100110011two's complement
64-bit1111111111111111111111111111111111111111111111100101100100110011two's complement
One's complement00000000000000011010011011001100at 32 bits, every bit flipped
Bits reversed11001100100110100111111111111111at 32 bits
Rotated left by 111111111111111001011001001100111at 32 bits, wrapping
Shifted left by 1-110100110110011010= -216,474, no wrap
Shifted right by 1-1101001101100111= -54,118, discarding the low bit
These bits as a double5.34761833 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-108,237 to the power 211,715,248,169
-108,237 to the power 3-1,268,023,316,068,053
-108,237 to the power 4137,247,039,661,257,852,561
-108,237 to the power 5-14,855,207,831,815,566,187,644,957
First ten multiples-108,237, -216,474, -324,711, -432,948, -541,185, -649,422, -757,659, -865,896, -974,133, -1,082,370
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 37
As a percentage & fraction
As a percentage-10,823,700%
-108,237% as a decimal-1,082.37
-108,237% of 100-108,237
-108,237% of 1,000-1,082,370
As a fraction of 100-108,237/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -108,237
Nerdulate something else
Nothing in mind? Surprise me · today’s page