Recognised as Number
-101,637
- Negative
- Odd
- 6 digits
-101,637 is an odd 6-digit integer and the negative of 101,637. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value101,637
Digit count6
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3^2 × 23 × 491
Distinct prime factors33, 23, 491
Number of divisors12
Sum of divisors σ(n)153,504
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 23, 69, 207, 491, 1,473, 4,419, 11,293, 33,879, 101,63712 in total
Arithmetic
Representations
Decimal-101,637
Binary1100011010000010117 bits
Octal306405
Hexadecimal18D05
Base 3626F9
In wordsminus one hundred and one thousand, six hundred and thirty-seven
Ordinalminus one hundred and one thousand, six hundred and thirty-seventh
Scientific notation-1.01637 × 10^5
Engineering notation-101.637 × 10^3
In other bases
Ternary12011102100base 3; the most digit-efficient integer base after e: 11 digits
Quinary11223022base 5; one hand: 8 digits
Septenary602214base 7: 6 digits
Nonary164370base 9; each digit is two ternary digits: 6 digits
Duodecimal4a999base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalce1hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal28:13:57base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110TTTT1T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111011011100001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100111001011111011
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 8d 05
Gray code10100101110000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100111001011111011two's complement
64-bit1111111111111111111111111111111111111111111111100111001011111011two's complement
One's complement00000000000000011000110100000100at 32 bits, every bit flipped
Bits reversed11011111010011100111111111111111at 32 bits
Rotated left by 111111111111111001110010111110111at 32 bits, wrapping
Shifted left by 1-110001101000001010= -203,274, no wrap
Shifted right by 1-1100011010000011= -50,818, discarding the low bit
These bits as a double5.021535 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-101,637 to the power 210,330,079,769
-101,637 to the power 3-1,049,918,317,481,853
-101,637 to the power 4106,710,548,033,903,093,361
-101,637 to the power 5-10,845,739,970,521,808,699,931,957
First ten multiples-101,637, -203,274, -304,911, -406,548, -508,185, -609,822, -711,459, -813,096, -914,733, -1,016,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 4
Divisible by 8No, remainder 5
Divisible by 9Yes
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,163,700%
-101,637% as a decimal-1,016.37
-101,637% of 100-101,637
-101,637% of 1,000-1,016,370
As a fraction of 100-101,637/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -101,637
Nerdulate something else
Nothing in mind? Surprise me · today’s page