The number 45513
45513 is a composite number with 12 divisors. Its prime factorisation is × 13 × 389. Divisors (12): 1, 3, 9, 13, 39, 117, 389, 1167, 3501, 5057, 15171, 45513.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
45513 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
45513 is composite. Its prime factorisation is
- 3
The divisors add up to 70980; without 45513 itself that is 25467, so 45513 is deficient (25467 is less than 45513). Euler's totient φ(45513) = 27936 numbers up to 45513 share no factor with it.
- 4
The digits of 45513 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45513 = 3^{2} \times 13 \times 389 \]45513 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 70980 |
| Euler totient φ(n) | 27936 |
| Square | 2071433169 |
| Cube | 94277137820697 |
| Square root | 213.337760 (= 3√5057) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.5513 × |
45513 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand five hundred and thirteen |
| Binary (base 2) | 1011000111001001 |
| Octal (base 8) | 130711 |
| Hexadecimal (base 16) | B1C9 |
| Base 3 | 2022102200 |
| As time | 45513 seconds = 12 h 38 min 33 s |
Is 45513 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 (45513 ÷ 3 = 15171) | 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 3) | 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 6) | 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 | Yes (45513 ÷ 9 = 5057) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 45513 a prime number?
No. 45513 = × 13 × 389, so it is divisible by 3.
What are the factors of 45513?
1, 3, 9, 13, 39, 117, 389, 1167, 3501, 5057, 15171, 45513.
What is 45513 in binary?
1011000111001001 (hexadecimal B1C9, octal 130711).
What is the square root of 45513?
About 213.3378, exactly 3√5057.
Is 45513 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 45513?
It is a composite number with 12 divisors.