The number 15065
15065 is a composite number with 8 divisors. Its prime factorisation is 5 × 23 × 131. Divisors (8): 1, 5, 23, 115, 131, 655, 3013, 15065.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15065 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15065 is composite. Its prime factorisation is
- 3
The divisors add up to 19008; without 15065 itself that is 3943, so 15065 is deficient (3943 is less than 15065). Euler's totient φ(15065) = 11440 numbers up to 15065 share no factor with it.
- 4
The digits of 15065 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15065 = 5 \times 23 \times 131 \]
15065 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19008 |
| Euler totient φ(n) | 11440 |
| Square | 226954225 |
| Cube | 3419065399625 |
| Square root | 122.739562 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.5065 × |
15065 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and sixty-five |
| Binary (base 2) | 11101011011001 |
| Octal (base 8) | 35331 |
| Hexadecimal (base 16) | 3AD9 |
| Base 3 | 202122222 |
| As time | 15065 seconds = 4 h 11 min 5 s |
Is 15065 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 2) | 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 (15065 ÷ 5 = 3013) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15065 a prime number?
No. 15065 = 5 × 23 × 131, so it is divisible by 5.
What are the factors of 15065?
1, 5, 23, 115, 131, 655, 3013, 15065.
What is 15065 in binary?
11101011011001 (hexadecimal 3AD9, octal 35331).
What is the square root of 15065?
About 122.7396.
Is 15065 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 15065?
It is a composite number with 8 divisors.