The number 20155
20155 is a composite number with 8 divisors. Its prime factorisation is 5 × 29 × 139. Divisors (8): 1, 5, 29, 139, 145, 695, 4031, 20155.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20155 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20155 is composite. Its prime factorisation is
- 3
The divisors add up to 25200; without 20155 itself that is 5045, so 20155 is deficient (5045 is less than 20155). Euler's totient φ(20155) = 15456 numbers up to 20155 share no factor with it.
- 4
The digits of 20155 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 92 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20155 = 5 \times 29 \times 139 \]
20155 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 25200 |
| Euler totient φ(n) | 15456 |
| Square | 406224025 |
| Cube | 8187445223875 |
| Square root | 141.968306 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 92 |
| Scientific notation | 2.0155 × |
20155 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and fifty-five |
| Binary (base 2) | 100111010111011 |
| Octal (base 8) | 47273 |
| Hexadecimal (base 16) | 4EBB |
| Base 3 | 1000122111 |
| As time | 20155 seconds = 5 h 35 min 55 s |
Is 20155 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 (20155 ÷ 5 = 4031) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 3) | 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 20155 a prime number?
No. 20155 = 5 × 29 × 139, so it is divisible by 5.
What are the factors of 20155?
1, 5, 29, 139, 145, 695, 4031, 20155.
What is 20155 in binary?
100111010111011 (hexadecimal 4EBB, octal 47273).
What is the square root of 20155?
About 141.9683.
Is 20155 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 20155?
It is a composite number with 8 divisors.