The number 53433
53433 is a composite number with 8 divisors. Its prime factorisation is × 1979. Divisors (8): 1, 3, 9, 27, 1979, 5937, 17811, 53433.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53433: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
53433 is composite. Its prime factorisation is
- 3
The divisors add up to 79200; without 53433 itself that is 25767, so 53433 is deficient (25767 is less than 53433). Euler's totient φ(53433) = 35604 numbers up to 53433 share no factor with it.
- 4
The digits of 53433 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53433 = 3^{3} \times 1979 \]53433 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 79200 |
| Euler totient φ(n) | 35604 |
| Square | 2855085489 |
| Cube | 152555782933737 |
| Square root | 231.155792 (= 3√5937) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 70 |
| Scientific notation | 5.3433 × |
53433 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand four hundred and thirty-three |
| Binary (base 2) | 1101000010111001 |
| Octal (base 8) | 150271 |
| Hexadecimal (base 16) | D0B9 |
| Base 3 | 2201022000 |
| As time | 53433 seconds = 14 h 50 min 33 s |
Is 53433 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 (53433 ÷ 3 = 17811) | 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 3) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (53433 ÷ 9 = 5937) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 53433 a prime number?
No. 53433 = × 1979, so it is divisible by 3.
What are the factors of 53433?
1, 3, 9, 27, 1979, 5937, 17811, 53433.
What is 53433 in binary?
1101000010111001 (hexadecimal D0B9, octal 150271).
What is the square root of 53433?
About 231.1558, exactly 3√5937.
Is 53433 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 53433?
53433 is a happy number: repeatedly adding the squares of its digits reaches 1.