The number 5145
5145 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × . Divisors (16): 1, 3, 5, 7, 15, 21, 35, 49, 105, 147, 245, 343, 735, 1029, 1715, 5145.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5145: a Harshad number: divisible by its digit sum 15.
- 2
5145 is composite. Its prime factorisation is
- 3
The divisors add up to 9600; without 5145 itself that is 4455, so 5145 is deficient (4455 is less than 5145). Euler's totient φ(5145) = 2352 numbers up to 5145 share no factor with it.
- 4
The digits of 5145 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 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5145 = 3 \times 5 \times 7^{3} \]5145 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 9600 |
| Euler totient φ(n) | 2352 |
| Square | 26471025 |
| Cube | 136193423625 |
| Square root | 71.728655 (= 7√105) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 59 |
| Scientific notation | 5.145 × |
5145 in other forms
| Form | Value |
|---|---|
| In words | five thousand one hundred and forty-five |
| Binary (base 2) | 1010000011001 |
| Octal (base 8) | 12031 |
| Hexadecimal (base 16) | 1419 |
| Base 3 | 21001120 |
| As time | 5145 seconds = 1 h 25 min 45 s |
Is 5145 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 (5145 ÷ 3 = 1715) | 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 (5145 ÷ 5 = 1029) | 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 (5145 ÷ 7 = 735) | 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 6) | 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 8) | 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 5145 a prime number?
No. 5145 = 3 × 5 × , so it is divisible by 3.
What are the factors of 5145?
1, 3, 5, 7, 15, 21, 35, 49, 105, 147, 245, 343, 735, 1029, 1715, 5145.
What is 5145 in binary?
1010000011001 (hexadecimal 1419, octal 12031).
What is the square root of 5145?
About 71.7287, exactly 7√105.
Is 5145 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 5145?
5145 is a Harshad number: divisible by its digit sum 15.