The number 59146
59146 is a composite number with 4 divisors. Its prime factorisation is 2 × 29573. Divisors (4): 1, 2, 29573, 59146.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59146: a semiprime: 2 × 29573, the product of two primes.
- 2
59146 is composite. Its prime factorisation is
- 3
The divisors add up to 88722; without 59146 itself that is 29576, so 59146 is deficient (29576 is less than 59146). Euler's totient φ(59146) = 29572 numbers up to 59146 share no factor with it.
- 4
The digits of 59146 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59146 = 2 \times 29573 \]
59146 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 88722 |
| Euler totient φ(n) | 29572 |
| Square | 3498249316 |
| Cube | 206907454044136 |
| Square root | 243.199507 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.9146 × |
59146 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand one hundred and forty-six |
| Binary (base 2) | 1110011100001010 |
| Octal (base 8) | 163412 |
| Hexadecimal (base 16) | E70A |
| Base 3 | 10000010121 |
| As time | 59146 seconds = 16 h 25 min 46 s |
Is 59146 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59146 ÷ 2 = 29573) | 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 2) | 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 4) | 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 2) | 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 6) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59146 a prime number?
No. 59146 = 2 × 29573, so it is divisible by 2.
What are the factors of 59146?
1, 2, 29573, 59146.
What is 59146 in binary?
1110011100001010 (hexadecimal E70A, octal 163412).
What is the square root of 59146?
About 243.1995.
Is 59146 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 59146?
59146 is a semiprime: 2 × 29573, the product of two primes.