The number 5435
5435 is a composite number with 4 divisors. Its prime factorisation is 5 × 1087. Divisors (4): 1, 5, 1087, 5435.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5435: a semiprime: 5 × 1087, the product of two primes.
- 2
5435 is composite. Its prime factorisation is
- 3
The divisors add up to 6528; without 5435 itself that is 1093, so 5435 is deficient (1093 is less than 5435). Euler's totient φ(5435) = 4344 numbers up to 5435 share no factor with it.
- 4
The digits of 5435 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 116 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5435 = 5 \times 1087 \]
5435 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6528 |
| Euler totient φ(n) | 4344 |
| Square | 29539225 |
| Cube | 160545687875 |
| Square root | 73.722452 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 116 |
| Scientific notation | 5.435 × |
5435 in other forms
| Form | Value |
|---|---|
| In words | five thousand four hundred and thirty-five |
| Binary (base 2) | 1010100111011 |
| Octal (base 8) | 12473 |
| Hexadecimal (base 16) | 153B |
| Base 3 | 21110022 |
| As time | 5435 seconds = 1 h 30 min 35 s |
Is 5435 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 2) | 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 (5435 ÷ 5 = 1087) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5435 a prime number?
No. 5435 = 5 × 1087, so it is divisible by 5.
What are the factors of 5435?
1, 5, 1087, 5435.
What is 5435 in binary?
1010100111011 (hexadecimal 153B, octal 12473).
What is the square root of 5435?
About 73.7225.
Is 5435 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 5435?
5435 is a semiprime: 5 × 1087, the product of two primes.