The number 42153
42153 is a composite number with 4 divisors. Its prime factorisation is 3 × 14051. Divisors (4): 1, 3, 14051, 42153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 42153: a semiprime: 3 × 14051, the product of two primes.
- 2
42153 is composite. Its prime factorisation is
- 3
The divisors add up to 56208; without 42153 itself that is 14055, so 42153 is deficient (14055 is less than 42153). Euler's totient φ(42153) = 28100 numbers up to 42153 share no factor with it.
- 4
The digits of 42153 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 181 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42153 = 3 \times 14051 \]
42153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56208 |
| Euler totient φ(n) | 28100 |
| Square | 1776875409 |
| Cube | 74900629115577 |
| Square root | 205.311958 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 181 |
| Scientific notation | 4.2153 × |
42153 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand one hundred and fifty-three |
| Binary (base 2) | 1010010010101001 |
| Octal (base 8) | 122251 |
| Hexadecimal (base 16) | A4A9 |
| Base 3 | 2010211020 |
| As time | 42153 seconds = 11 h 42 min 33 s |
Is 42153 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 (42153 ÷ 3 = 14051) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 6) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 42153 a prime number?
No. 42153 = 3 × 14051, so it is divisible by 3.
What are the factors of 42153?
1, 3, 14051, 42153.
What is 42153 in binary?
1010010010101001 (hexadecimal A4A9, octal 122251).
What is the square root of 42153?
About 205.3120.
Is 42153 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 42153?
42153 is a semiprime: 3 × 14051, the product of two primes.