The number 1501
1501 is a binary palindrome (10111011101). Its prime factorisation is 19 × 79. Divisors (4): 1, 19, 79, 1501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1501: a binary palindrome (10111011101); a semiprime: 19 × 79, the product of two primes.
- 2
1501 is composite. Its prime factorisation is
- 3
The divisors add up to 1600; without 1501 itself that is 99, so 1501 is deficient (99 is less than 1501). Euler's totient φ(1501) = 1404 numbers up to 1501 share no factor with it.
- 4
The digits of 1501 add up to 7, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1501 = 19 \times 79 \]
1501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1600 |
| Euler totient φ(n) | 1404 |
| Square | 2253001 |
| Cube | 3381754501 |
| Square root | 38.742741 |
| Digit sum / digital root | 7 / 7 |
| Collatz steps to 1 | 47 |
| Scientific notation | 1.501 × |
1501 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and one |
| Roman numerals | MDI |
| Binary (base 2) | 10111011101 |
| Octal (base 8) | 2735 |
| Hexadecimal (base 16) | 5DD |
| Base 3 | 2001121 |
| As time | 1501 seconds = 25 min 1 s |
Is 1501 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1501 a prime number?
No. 1501 = 19 × 79, so it is divisible by 19.
What are the factors of 1501?
1, 19, 79, 1501.
What is 1501 in binary?
10111011101 (hexadecimal 5DD, octal 2735).
What is the square root of 1501?
About 38.7427.
What is 1501 in Roman numerals?
MDI.
Is 1501 divisible by 3?
No. Its digits add up to 7, which is not a multiple of 3.
What is special about the number 1501?
1501 is a binary palindrome (10111011101); a semiprime: 19 × 79, the product of two primes.