The number 20115
20115 is a composite number with 16 divisors. Its prime factorisation is × 5 × 149. Divisors (16): 1, 3, 5, 9, 15, 27, 45, 135, 149, 447, 745, 1341, 2235, 4023, 6705, 20115.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20115: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
20115 is composite. Its prime factorisation is
- 3
The divisors add up to 36000; without 20115 itself that is 15885, so 20115 is deficient (15885 is less than 20115). Euler's totient φ(20115) = 10656 numbers up to 20115 share no factor with it.
- 4
The digits of 20115 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 118 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20115 = 3^{3} \times 5 \times 149 \]20115 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 36000 |
| Euler totient φ(n) | 10656 |
| Square | 404613225 |
| Cube | 8138795020875 |
| Square root | 141.827360 (= 3√2235) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 118 |
| Scientific notation | 2.0115 × |
20115 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and fifteen |
| Binary (base 2) | 100111010010011 |
| Octal (base 8) | 47223 |
| Hexadecimal (base 16) | 4E93 |
| Base 3 | 1000121000 |
| As time | 20115 seconds = 5 h 35 min 15 s |
Is 20115 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 (20115 ÷ 3 = 6705) | 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 (20115 ÷ 5 = 4023) | 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 4) | 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 | Yes (20115 ÷ 9 = 2235) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20115 a prime number?
No. 20115 = × 5 × 149, so it is divisible by 3.
What are the factors of 20115?
1, 3, 5, 9, 15, 27, 45, 135, 149, 447, 745, 1341, 2235, 4023, 6705, 20115.
What is 20115 in binary?
100111010010011 (hexadecimal 4E93, octal 47223).
What is the square root of 20115?
About 141.8274, exactly 3√2235.
Is 20115 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 20115?
20115 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.