The number 15069
15069 is a composite number with 4 divisors. Its prime factorisation is 3 × 5023. Divisors (4): 1, 3, 5023, 15069.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15069: a semiprime: 3 × 5023, the product of two primes.
- 2
15069 is composite. Its prime factorisation is
- 3
The divisors add up to 20096; without 15069 itself that is 5027, so 15069 is deficient (5027 is less than 15069). Euler's totient φ(15069) = 10044 numbers up to 15069 share no factor with it.
- 4
The digits of 15069 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15069 = 3 \times 5023 \]
15069 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20096 |
| Euler totient φ(n) | 10044 |
| Square | 227074761 |
| Cube | 3421789573509 |
| Square root | 122.755855 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.5069 × |
15069 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and sixty-nine |
| Binary (base 2) | 11101011011101 |
| Octal (base 8) | 35335 |
| Hexadecimal (base 16) | 3ADD |
| Base 3 | 202200010 |
| As time | 15069 seconds = 4 h 11 min 9 s |
Is 15069 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 (15069 ÷ 3 = 5023) | 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 4) | 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 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 15069 a prime number?
No. 15069 = 3 × 5023, so it is divisible by 3.
What are the factors of 15069?
1, 3, 5023, 15069.
What is 15069 in binary?
11101011011101 (hexadecimal 3ADD, octal 35335).
What is the square root of 15069?
About 122.7559.
Is 15069 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 15069?
15069 is a semiprime: 3 × 5023, the product of two primes.