The number 59469
59469 is a composite number with 8 divisors. Its prime factorisation is 3 × 43 × 461. Divisors (8): 1, 3, 43, 129, 461, 1383, 19823, 59469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59469: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
59469 is composite. Its prime factorisation is
- 3
The divisors add up to 81312; without 59469 itself that is 21843, so 59469 is deficient (21843 is less than 59469). Euler's totient φ(59469) = 38640 numbers up to 59469 share no factor with it.
- 4
The digits of 59469 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59469 = 3 \times 43 \times 461 \]
59469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 81312 |
| Euler totient φ(n) | 38640 |
| Square | 3536561961 |
| Cube | 210315803258709 |
| Square root | 243.862666 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.9469 × |
59469 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand four hundred and sixty-nine |
| Binary (base 2) | 1110100001001101 |
| Octal (base 8) | 164115 |
| Hexadecimal (base 16) | E84D |
| Base 3 | 10000120120 |
| As time | 59469 seconds = 16 h 31 min 9 s |
Is 59469 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 (59469 ÷ 3 = 19823) | 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 4) | 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 5) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 59469 a prime number?
No. 59469 = 3 × 43 × 461, so it is divisible by 3.
What are the factors of 59469?
1, 3, 43, 129, 461, 1383, 19823, 59469.
What is 59469 in binary?
1110100001001101 (hexadecimal E84D, octal 164115).
What is the square root of 59469?
About 243.8627.
Is 59469 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 59469?
59469 is a happy number: repeatedly adding the squares of its digits reaches 1.