The number 59097
59097 is a composite number with 4 divisors. Its prime factorisation is 3 × 19699. Divisors (4): 1, 3, 19699, 59097.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59097: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 19699, the product of two primes.
- 2
59097 is composite. Its prime factorisation is
- 3
The divisors add up to 78800; without 59097 itself that is 19703, so 59097 is deficient (19703 is less than 59097). Euler's totient φ(59097) = 39396 numbers up to 59097 share no factor with it.
- 4
The digits of 59097 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59097 = 3 \times 19699 \]
59097 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 78800 |
| Euler totient φ(n) | 39396 |
| Square | 3492455409 |
| Cube | 206393637305673 |
| Square root | 243.098745 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.9097 × |
59097 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and ninety-seven |
| Binary (base 2) | 1110011011011001 |
| Octal (base 8) | 163331 |
| Hexadecimal (base 16) | E6D9 |
| Base 3 | 10000001210 |
| As time | 59097 seconds = 16 h 24 min 57 s |
Is 59097 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 (59097 ÷ 3 = 19699) | 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 2) | 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 3) | 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 1) | 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 7) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59097 a prime number?
No. 59097 = 3 × 19699, so it is divisible by 3.
What are the factors of 59097?
1, 3, 19699, 59097.
What is 59097 in binary?
1110011011011001 (hexadecimal E6D9, octal 163331).
What is the square root of 59097?
About 243.0987.
Is 59097 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 59097?
59097 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 19699, the product of two primes.