The number 52435
52435 is a composite number with 4 divisors. Its prime factorisation is 5 × 10487. Divisors (4): 1, 5, 10487, 52435.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52435: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10487, the product of two primes.
- 2
52435 is composite. Its prime factorisation is
- 3
The divisors add up to 62928; without 52435 itself that is 10493, so 52435 is deficient (10493 is less than 52435). Euler's totient φ(52435) = 41944 numbers up to 52435 share no factor with it.
- 4
The digits of 52435 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52435 = 5 \times 10487 \]
52435 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 62928 |
| Euler totient φ(n) | 41944 |
| Square | 2749429225 |
| Cube | 144166321412875 |
| Square root | 228.986899 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.2435 × |
52435 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand four hundred and thirty-five |
| Binary (base 2) | 1100110011010011 |
| Octal (base 8) | 146323 |
| Hexadecimal (base 16) | CCD3 |
| Base 3 | 2122221001 |
| As time | 52435 seconds = 14 h 33 min 55 s |
Is 52435 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 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (52435 ÷ 5 = 10487) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52435 a prime number?
No. 52435 = 5 × 10487, so it is divisible by 5.
What are the factors of 52435?
1, 5, 10487, 52435.
What is 52435 in binary?
1100110011010011 (hexadecimal CCD3, octal 146323).
What is the square root of 52435?
About 228.9869.
Is 52435 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 52435?
52435 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10487, the product of two primes.