The number 45505
45505 is a composite number with 8 divisors. Its prime factorisation is 5 × 19 × 479. Divisors (8): 1, 5, 19, 95, 479, 2395, 9101, 45505.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 45505: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 19.
- 2
45505 is composite. Its prime factorisation is
- 3
The divisors add up to 57600; without 45505 itself that is 12095, so 45505 is deficient (12095 is less than 45505). Euler's totient φ(45505) = 34416 numbers up to 45505 share no factor with it.
- 4
The digits of 45505 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45505 = 5 \times 19 \times 479 \]
45505 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 57600 |
| Euler totient φ(n) | 34416 |
| Square | 2070705025 |
| Cube | 94227432162625 |
| Square root | 213.319010 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.5505 × |
45505 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand five hundred and five |
| Binary (base 2) | 1011000111000001 |
| Octal (base 8) | 130701 |
| Hexadecimal (base 16) | B1C1 |
| Base 3 | 2022102101 |
| As time | 45505 seconds = 12 h 38 min 25 s |
Is 45505 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 | Yes (45505 ÷ 5 = 9101) | 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 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 45505 a prime number?
No. 45505 = 5 × 19 × 479, so it is divisible by 5.
What are the factors of 45505?
1, 5, 19, 95, 479, 2395, 9101, 45505.
What is 45505 in binary?
1011000111000001 (hexadecimal B1C1, octal 130701).
What is the square root of 45505?
About 213.3190.
Is 45505 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 45505?
45505 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 19.