The number 15068
15068 is a composite number with 6 divisors. Its prime factorisation is × 3767. Divisors (6): 1, 2, 4, 3767, 7534, 15068.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15068 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15068 is composite. Its prime factorisation is
- 3
The divisors add up to 26376; without 15068 itself that is 11308, so 15068 is deficient (11308 is less than 15068). Euler's totient φ(15068) = 7532 numbers up to 15068 share no factor with it.
- 4
The digits of 15068 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15068 = 2^{2} \times 3767 \]15068 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 26376 |
| Euler totient φ(n) | 7532 |
| Square | 227044624 |
| Cube | 3421108394432 |
| Square root | 122.751782 (= 2√3767) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.5068 × |
15068 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and sixty-eight |
| Binary (base 2) | 11101011011100 |
| Octal (base 8) | 35334 |
| Hexadecimal (base 16) | 3ADC |
| Base 3 | 202200002 |
| As time | 15068 seconds = 4 h 11 min 8 s |
Is 15068 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15068 ÷ 2 = 7534) | 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 | Yes (15068 ÷ 4 = 3767) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15068 a prime number?
No. 15068 = × 3767, so it is divisible by 2.
What are the factors of 15068?
1, 2, 4, 3767, 7534, 15068.
What is 15068 in binary?
11101011011100 (hexadecimal 3ADC, octal 35334).
What is the square root of 15068?
About 122.7518, exactly 2√3767.
Is 15068 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 15068?
It is a composite number with 6 divisors.