The number 15067
15067 is a composite number with 8 divisors. Its prime factorisation is 13 × 19 × 61. Divisors (8): 1, 13, 19, 61, 247, 793, 1159, 15067.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15067: a Harshad number: divisible by its digit sum 19.
- 2
15067 is composite. Its prime factorisation is
- 3
The divisors add up to 17360; without 15067 itself that is 2293, so 15067 is deficient (2293 is less than 15067). Euler's totient φ(15067) = 12960 numbers up to 15067 share no factor with it.
- 4
The digits of 15067 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 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15067 = 13 \times 19 \times 61 \]
15067 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 17360 |
| Euler totient φ(n) | 12960 |
| Square | 227014489 |
| Cube | 3420427305763 |
| Square root | 122.747709 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.5067 × |
15067 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and sixty-seven |
| Binary (base 2) | 11101011011011 |
| Octal (base 8) | 35333 |
| Hexadecimal (base 16) | 3ADB |
| Base 3 | 202200001 |
| As time | 15067 seconds = 4 h 11 min 7 s |
Is 15067 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 1) | 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 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15067 a prime number?
No. 15067 = 13 × 19 × 61, so it is divisible by 13.
What are the factors of 15067?
1, 13, 19, 61, 247, 793, 1159, 15067.
What is 15067 in binary?
11101011011011 (hexadecimal 3ADB, octal 35333).
What is the square root of 15067?
About 122.7477.
Is 15067 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 15067?
15067 is a Harshad number: divisible by its digit sum 19.