The number 58071
58071 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 1489. Divisors (8): 1, 3, 13, 39, 1489, 4467, 19357, 58071.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 58071: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
58071 is composite. Its prime factorisation is
- 3
The divisors add up to 83440; without 58071 itself that is 25369, so 58071 is deficient (25369 is less than 58071). Euler's totient φ(58071) = 35712 numbers up to 58071 share no factor with it.
- 4
The digits of 58071 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 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58071 = 3 \times 13 \times 1489 \]
58071 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 83440 |
| Euler totient φ(n) | 35712 |
| Square | 3372241041 |
| Cube | 195829409491911 |
| Square root | 240.979252 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.8071 × |
58071 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand and seventy-one |
| Binary (base 2) | 1110001011010111 |
| Octal (base 8) | 161327 |
| Hexadecimal (base 16) | E2D7 |
| Base 3 | 2221122210 |
| As time | 58071 seconds = 16 h 7 min 51 s |
Is 58071 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 (58071 ÷ 3 = 19357) | 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 1) | 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 6) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 58071 a prime number?
No. 58071 = 3 × 13 × 1489, so it is divisible by 3.
What are the factors of 58071?
1, 3, 13, 39, 1489, 4467, 19357, 58071.
What is 58071 in binary?
1110001011010111 (hexadecimal E2D7, octal 161327).
What is the square root of 58071?
About 240.9793.
Is 58071 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 58071?
58071 is a happy number: repeatedly adding the squares of its digits reaches 1.