Recognised as Number
-101,501
- Negative
- Odd
- 6 digits
-101,501 is an odd 6-digit integer and the negative of 101,501. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value101,501
Digit count6
Digit sum8
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 × 101,501
Distinct prime factors1101,501
Number of divisors2
Sum of divisors σ(n)101,502
SquarefreeYesno repeated prime factor
All divisors1, 101,5012 in total
Arithmetic
Representations
Decimal-101,501
Binary1100011000111110117 bits
Octal306175
Hexadecimal18C7D
Base 3626BH
In wordsminus one hundred and one thousand, five hundred and one
Ordinalminus one hundred and one thousand, five hundred and first
Scientific notation-1.01501 × 10^5
Engineering notation-101.501 × 10^3
In other bases
Ternary12011020022base 3; the most digit-efficient integer base after e: 11 digits
Quinary11222001base 5; one hand: 8 digits
Septenary601631base 7: 6 digits
Nonary164208base 9; each digit is two ternary digits: 6 digits
Duodecimal4a8a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalcdf1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal28:11:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT110TTT10T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111011010010000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100111001110000011
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 8c 7d
Gray code10100101001000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100111001110000011two's complement
64-bit1111111111111111111111111111111111111111111111100111001110000011two's complement
One's complement00000000000000011000110001111100at 32 bits, every bit flipped
Bits reversed11000001110011100111111111111111at 32 bits
Rotated left by 111111111111111001110011100000111at 32 bits, wrapping
Shifted left by 1-110001100011111010= -203,002, no wrap
Shifted right by 1-1100011000111111= -50,750, discarding the low bit
These bits as a double5.01481571 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-101,501 to the power 210,302,453,001
-101,501 to the power 3-1,045,709,282,054,501
-101,501 to the power 4106,140,537,837,813,906,001
-101,501 to the power 5-10,773,370,731,075,949,273,007,501
First ten multiples-101,501, -203,002, -304,503, -406,004, -507,505, -609,006, -710,507, -812,008, -913,509, -1,015,010
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 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-10,150,100%
-101,501% as a decimal-1,015.01
-101,501% of 100-101,501
-101,501% of 1,000-1,015,010
As a fraction of 100-101,501/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -101,501
Nerdulate something else
Nothing in mind? Surprise me · today’s page