The number 48070
48070 is a composite number with 32 divisors. Its prime factorisation is 2 × 5 × 11 × 19 × 23. Divisors (32): 1, 2, 5, 10, 11, 19, 22, 23, 38, 46, 55, 95, 110, 115, 190, 209 … 48070.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48070: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 19.
- 2
48070 is composite. Its prime factorisation is
- 3
The divisors add up to 103680; without 48070 itself that is 55610, so 48070 is abundant (55610 is more than 48070). Euler's totient φ(48070) = 15840 numbers up to 48070 share no factor with it.
- 4
The digits of 48070 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48070 = 2 \times 5 \times 11 \times 19 \times 23 \]
48070 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 103680 |
| Euler totient φ(n) | 15840 |
| Square | 2310724900 |
| Cube | 111076545943000 |
| Square root | 219.248717 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.807 × |
48070 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and seventy |
| Binary (base 2) | 1011101111000110 |
| Octal (base 8) | 135706 |
| Hexadecimal (base 16) | BBC6 |
| Base 3 | 2102221101 |
| As time | 48070 seconds = 13 h 21 min 10 s |
Is 48070 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48070 ÷ 2 = 24035) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (48070 ÷ 5 = 9614) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 6) | 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 | Yes (48070 ÷ 10 = 4807) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (48070 ÷ 11 = 4370) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48070 a prime number?
No. 48070 = 2 × 5 × 11 × 19 × 23, so it is divisible by 2.
What are the factors of 48070?
1, 2, 5, 10, 11, 19, 22, 23, 38, 46, 55, 95, 110, 115, 190, 209, 230, 253, 418, 437, 506, 874, 1045, 1265, 2090, 2185, 2530, 4370, 4807, 9614, 24035, 48070.
What is 48070 in binary?
1011101111000110 (hexadecimal BBC6, octal 135706).
What is the square root of 48070?
About 219.2487.
Is 48070 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 48070?
48070 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 19.