The number 15047
15047 is a composite number with 4 divisors. Its prime factorisation is 41 × 367. Divisors (4): 1, 41, 367, 15047.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15047: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 41 × 367, the product of two primes.
- 2
15047 is composite. Its prime factorisation is
- 3
The divisors add up to 15456; without 15047 itself that is 409, so 15047 is deficient (409 is less than 15047). Euler's totient φ(15047) = 14640 numbers up to 15047 share no factor with it.
- 4
The digits of 15047 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 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15047 = 41 \times 367 \]
15047 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15456 |
| Euler totient φ(n) | 14640 |
| Square | 226412209 |
| Cube | 3406824508823 |
| Square root | 122.666214 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.5047 × |
15047 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and forty-seven |
| Binary (base 2) | 11101011000111 |
| Octal (base 8) | 35307 |
| Hexadecimal (base 16) | 3AC7 |
| Base 3 | 202122022 |
| As time | 15047 seconds = 4 h 10 min 47 s |
Is 15047 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 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 5) | 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 7) | 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 7) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15047 a prime number?
No. 15047 = 41 × 367, so it is divisible by 41.
What are the factors of 15047?
1, 41, 367, 15047.
What is 15047 in binary?
11101011000111 (hexadecimal 3AC7, octal 35307).
What is the square root of 15047?
About 122.6662.
Is 15047 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 15047?
15047 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 41 × 367, the product of two primes.