The number 20035
20035 is a composite number with 4 divisors. Its prime factorisation is 5 × 4007. Divisors (4): 1, 5, 4007, 20035.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20035: a semiprime: 5 × 4007, the product of two primes.
- 2
20035 is composite. Its prime factorisation is
- 3
The divisors add up to 24048; without 20035 itself that is 4013, so 20035 is deficient (4013 is less than 20035). Euler's totient φ(20035) = 16024 numbers up to 20035 share no factor with it.
- 4
The digits of 20035 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 92 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20035 = 5 \times 4007 \]
20035 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 24048 |
| Euler totient φ(n) | 16024 |
| Square | 401401225 |
| Cube | 8042073542875 |
| Square root | 141.545046 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 92 |
| Scientific notation | 2.0035 × |
20035 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand and thirty-five |
| Binary (base 2) | 100111001000011 |
| Octal (base 8) | 47103 |
| Hexadecimal (base 16) | 4E43 |
| Base 3 | 1000111001 |
| As time | 20035 seconds = 5 h 33 min 55 s |
Is 20035 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 (20035 ÷ 5 = 4007) | 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 1) | 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 4) | 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 20035 a prime number?
No. 20035 = 5 × 4007, so it is divisible by 5.
What are the factors of 20035?
1, 5, 4007, 20035.
What is 20035 in binary?
100111001000011 (hexadecimal 4E43, octal 47103).
What is the square root of 20035?
About 141.5450.
Is 20035 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 20035?
20035 is a semiprime: 5 × 4007, the product of two primes.