The number 53469
53469 is a composite number with 12 divisors. Its prime factorisation is × 13 × 457. Divisors (12): 1, 3, 9, 13, 39, 117, 457, 1371, 4113, 5941, 17823, 53469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53469: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
53469 is composite. Its prime factorisation is
- 3
The divisors add up to 83356; without 53469 itself that is 29887, so 53469 is deficient (29887 is less than 53469). Euler's totient φ(53469) = 32832 numbers up to 53469 share no factor with it.
- 4
The digits of 53469 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53469 = 3^{2} \times 13 \times 457 \]53469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 83356 |
| Euler totient φ(n) | 32832 |
| Square | 2858933961 |
| Cube | 152864339960709 |
| Square root | 231.233648 (= 3√5941) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 96 |
| Scientific notation | 5.3469 × |
53469 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand four hundred and sixty-nine |
| Binary (base 2) | 1101000011011101 |
| Octal (base 8) | 150335 |
| Hexadecimal (base 16) | D0DD |
| Base 3 | 2201100100 |
| As time | 53469 seconds = 14 h 51 min 9 s |
Is 53469 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 (53469 ÷ 3 = 17823) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (53469 ÷ 9 = 5941) | 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 9) | 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 53469 a prime number?
No. 53469 = × 13 × 457, so it is divisible by 3.
What are the factors of 53469?
1, 3, 9, 13, 39, 117, 457, 1371, 4113, 5941, 17823, 53469.
What is 53469 in binary?
1101000011011101 (hexadecimal D0DD, octal 150335).
What is the square root of 53469?
About 231.2336, exactly 3√5941.
Is 53469 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 53469?
53469 is a happy number: repeatedly adding the squares of its digits reaches 1.