The number 59468
59468 is a composite number with 6 divisors. Its prime factorisation is × 14867. Divisors (6): 1, 2, 4, 14867, 29734, 59468.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59468 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59468 is composite. Its prime factorisation is
- 3
The divisors add up to 104076; without 59468 itself that is 44608, so 59468 is deficient (44608 is less than 59468). Euler's totient φ(59468) = 29732 numbers up to 59468 share no factor with it.
- 4
The digits of 59468 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59468 = 2^{2} \times 14867 \]59468 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 104076 |
| Euler totient φ(n) | 29732 |
| Square | 3536443024 |
| Cube | 210305193751232 |
| Square root | 243.860616 (= 2√14867) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.9468 × |
59468 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand four hundred and sixty-eight |
| Binary (base 2) | 1110100001001100 |
| Octal (base 8) | 164114 |
| Hexadecimal (base 16) | E84C |
| Base 3 | 10000120112 |
| As time | 59468 seconds = 16 h 31 min 8 s |
Is 59468 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59468 ÷ 2 = 29734) | 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 | Yes (59468 ÷ 4 = 14867) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59468 a prime number?
No. 59468 = × 14867, so it is divisible by 2.
What are the factors of 59468?
1, 2, 4, 14867, 29734, 59468.
What is 59468 in binary?
1110100001001100 (hexadecimal E84C, octal 164114).
What is the square root of 59468?
About 243.8606, exactly 2√14867.
Is 59468 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 59468?
It is a composite number with 6 divisors.