The number 59091
59091 is a composite number with 4 divisors. Its prime factorisation is 3 × 19697. Divisors (4): 1, 3, 19697, 59091.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59091: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 19697, the product of two primes.
- 2
59091 is composite. Its prime factorisation is
- 3
The divisors add up to 78792; without 59091 itself that is 19701, so 59091 is deficient (19701 is less than 59091). Euler's totient φ(59091) = 39392 numbers up to 59091 share no factor with it.
- 4
The digits of 59091 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59091 = 3 \times 19697 \]
59091 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 78792 |
| Euler totient φ(n) | 39392 |
| Square | 3491746281 |
| Cube | 206330779490571 |
| Square root | 243.086404 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.9091 × |
59091 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and ninety-one |
| Binary (base 2) | 1110011011010011 |
| Octal (base 8) | 163323 |
| Hexadecimal (base 16) | E6D3 |
| Base 3 | 10000001120 |
| As time | 59091 seconds = 16 h 24 min 51 s |
Is 59091 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 (59091 ÷ 3 = 19697) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 10) | 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 59091 a prime number?
No. 59091 = 3 × 19697, so it is divisible by 3.
What are the factors of 59091?
1, 3, 19697, 59091.
What is 59091 in binary?
1110011011010011 (hexadecimal E6D3, octal 163323).
What is the square root of 59091?
About 243.0864.
Is 59091 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 59091?
59091 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 19697, the product of two primes.