The number 45501
45501 is a composite number with 8 divisors. Its prime factorisation is 3 × 29 × 523. Divisors (8): 1, 3, 29, 87, 523, 1569, 15167, 45501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
45501 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
45501 is composite. Its prime factorisation is
- 3
The divisors add up to 62880; without 45501 itself that is 17379, so 45501 is deficient (17379 is less than 45501). Euler's totient φ(45501) = 29232 numbers up to 45501 share no factor with it.
- 4
The digits of 45501 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45501 = 3 \times 29 \times 523 \]
45501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 62880 |
| Euler totient φ(n) | 29232 |
| Square | 2070341001 |
| Cube | 94202585886501 |
| Square root | 213.309634 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.5501 × |
45501 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand five hundred and one |
| Binary (base 2) | 1011000110111101 |
| Octal (base 8) | 130675 |
| Hexadecimal (base 16) | B1BD |
| Base 3 | 2022102020 |
| As time | 45501 seconds = 12 h 38 min 21 s |
Is 45501 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 | Yes (45501 ÷ 3 = 15167) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 45501 a prime number?
No. 45501 = 3 × 29 × 523, so it is divisible by 3.
What are the factors of 45501?
1, 3, 29, 87, 523, 1569, 15167, 45501.
What is 45501 in binary?
1011000110111101 (hexadecimal B1BD, octal 130675).
What is the square root of 45501?
About 213.3096.
Is 45501 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 45501?
It is a composite number with 8 divisors.