The number 59474
59474 is a composite number with 8 divisors. Its prime factorisation is 2 × 131 × 227. Divisors (8): 1, 2, 131, 227, 262, 454, 29737, 59474.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59474 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59474 is composite. Its prime factorisation is
- 3
The divisors add up to 90288; without 59474 itself that is 30814, so 59474 is deficient (30814 is less than 59474). Euler's totient φ(59474) = 29380 numbers up to 59474 share no factor with it.
- 4
The digits of 59474 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59474 = 2 \times 131 \times 227 \]
59474 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 90288 |
| Euler totient φ(n) | 29380 |
| Square | 3537156676 |
| Cube | 210368856148424 |
| Square root | 243.872918 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.9474 × |
59474 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand four hundred and seventy-four |
| Binary (base 2) | 1110100001010010 |
| Octal (base 8) | 164122 |
| Hexadecimal (base 16) | E852 |
| Base 3 | 10000120202 |
| As time | 59474 seconds = 16 h 31 min 14 s |
Is 59474 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59474 ÷ 2 = 29737) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59474 a prime number?
No. 59474 = 2 × 131 × 227, so it is divisible by 2.
What are the factors of 59474?
1, 2, 131, 227, 262, 454, 29737, 59474.
What is 59474 in binary?
1110100001010010 (hexadecimal E852, octal 164122).
What is the square root of 59474?
About 243.8729.
Is 59474 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 59474?
It is a composite number with 8 divisors.