The number 59031
59031 is a composite number with 12 divisors. Its prime factorisation is × 7 × 937. Divisors (12): 1, 3, 7, 9, 21, 63, 937, 2811, 6559, 8433, 19677, 59031.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59031 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59031 is composite. Its prime factorisation is
- 3
The divisors add up to 97552; without 59031 itself that is 38521, so 59031 is deficient (38521 is less than 59031). Euler's totient φ(59031) = 33696 numbers up to 59031 share no factor with it.
- 4
The digits of 59031 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59031 = 3^{2} \times 7 \times 937 \]59031 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 97552 |
| Euler totient φ(n) | 33696 |
| Square | 3484658961 |
| Cube | 205702903126791 |
| Square root | 242.962960 (= 3√6559) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 104 |
| Scientific notation | 5.9031 × |
59031 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and thirty-one |
| Binary (base 2) | 1110011010010111 |
| Octal (base 8) | 163227 |
| Hexadecimal (base 16) | E697 |
| Base 3 | 2222222100 |
| As time | 59031 seconds = 16 h 23 min 51 s |
Is 59031 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 (59031 ÷ 3 = 19677) | 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 | Yes (59031 ÷ 7 = 8433) | 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 | Yes (59031 ÷ 9 = 6559) | 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 5) | 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 59031 a prime number?
No. 59031 = × 7 × 937, so it is divisible by 3.
What are the factors of 59031?
1, 3, 7, 9, 21, 63, 937, 2811, 6559, 8433, 19677, 59031.
What is 59031 in binary?
1110011010010111 (hexadecimal E697, octal 163227).
What is the square root of 59031?
About 242.9630, exactly 3√6559.
Is 59031 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 59031?
It is a composite number with 12 divisors.