The number 59047
59047 is a composite number with 4 divisors. Its prime factorisation is 137 × 431. Divisors (4): 1, 137, 431, 59047.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59047: a semiprime: 137 × 431, the product of two primes.
- 2
59047 is composite. Its prime factorisation is
- 3
The divisors add up to 59616; without 59047 itself that is 569, so 59047 is deficient (569 is less than 59047). Euler's totient φ(59047) = 58480 numbers up to 59047 share no factor with it.
- 4
The digits of 59047 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59047 = 137 \times 431 \]
59047 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 59616 |
| Euler totient φ(n) | 58480 |
| Square | 3486548209 |
| Cube | 205870212096823 |
| Square root | 242.995885 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.9047 × |
59047 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and forty-seven |
| Binary (base 2) | 1110011010100111 |
| Octal (base 8) | 163247 |
| Hexadecimal (base 16) | E6A7 |
| Base 3 | 2222222221 |
| As time | 59047 seconds = 16 h 24 min 7 s |
Is 59047 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 2) | 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 7) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59047 a prime number?
No. 59047 = 137 × 431, so it is divisible by 137.
What are the factors of 59047?
1, 137, 431, 59047.
What is 59047 in binary?
1110011010100111 (hexadecimal E6A7, octal 163247).
What is the square root of 59047?
About 242.9959.
Is 59047 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 59047?
59047 is a semiprime: 137 × 431, the product of two primes.