The number 45507
45507 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 11 × 197. Divisors (16): 1, 3, 7, 11, 21, 33, 77, 197, 231, 591, 1379, 2167, 4137, 6501, 15169, 45507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 45507: a Harshad number: divisible by its digit sum 21.
- 2
45507 is composite. Its prime factorisation is
- 3
The divisors add up to 76032; without 45507 itself that is 30525, so 45507 is deficient (30525 is less than 45507). Euler's totient φ(45507) = 23520 numbers up to 45507 share no factor with it.
- 4
The digits of 45507 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45507 = 3 \times 7 \times 11 \times 197 \]
45507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 76032 |
| Euler totient φ(n) | 23520 |
| Square | 2070887049 |
| Cube | 94239856938843 |
| Square root | 213.323698 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.5507 × |
45507 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand five hundred and seven |
| Binary (base 2) | 1011000111000011 |
| Octal (base 8) | 130703 |
| Hexadecimal (base 16) | B1C3 |
| Base 3 | 2022102110 |
| As time | 45507 seconds = 12 h 38 min 27 s |
Is 45507 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 (45507 ÷ 3 = 15169) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 | Yes (45507 ÷ 7 = 6501) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (45507 ÷ 11 = 4137) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 45507 a prime number?
No. 45507 = 3 × 7 × 11 × 197, so it is divisible by 3.
What are the factors of 45507?
1, 3, 7, 11, 21, 33, 77, 197, 231, 591, 1379, 2167, 4137, 6501, 15169, 45507.
What is 45507 in binary?
1011000111000011 (hexadecimal B1C3, octal 130703).
What is the square root of 45507?
About 213.3237.
Is 45507 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 45507?
45507 is a Harshad number: divisible by its digit sum 21.