The number 48090
48090 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 7 × 229. Divisors (32): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 210 … 48090.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48090: a Harshad number: divisible by its digit sum 21.
- 2
48090 is composite. Its prime factorisation is
- 3
The divisors add up to 132480; without 48090 itself that is 84390, so 48090 is abundant (84390 is more than 48090). Euler's totient φ(48090) = 10944 numbers up to 48090 share no factor with it.
- 4
The digits of 48090 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48090 = 2 \times 3 \times 5 \times 7 \times 229 \]
48090 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 132480 |
| Euler totient φ(n) | 10944 |
| Square | 2312648100 |
| Cube | 111215247129000 |
| Square root | 219.294323 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 44 |
| Scientific notation | 4.809 × |
48090 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and ninety |
| Binary (base 2) | 1011101111011010 |
| Octal (base 8) | 135732 |
| Hexadecimal (base 16) | BBDA |
| Base 3 | 2102222010 |
| As time | 48090 seconds = 13 h 21 min 30 s |
Is 48090 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48090 ÷ 2 = 24045) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48090 ÷ 3 = 16030) | 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 (48090 ÷ 5 = 9618) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (48090 ÷ 6 = 8015) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (48090 ÷ 7 = 6870) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (48090 ÷ 10 = 4809) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48090 a prime number?
No. 48090 = 2 × 3 × 5 × 7 × 229, so it is divisible by 2.
What are the factors of 48090?
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 210, 229, 458, 687, 1145, 1374, 1603, 2290, 3206, 3435, 4809, 6870, 8015, 9618, 16030, 24045, 48090.
What is 48090 in binary?
1011101111011010 (hexadecimal BBDA, octal 135732).
What is the square root of 48090?
About 219.2943.
Is 48090 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 48090?
48090 is a Harshad number: divisible by its digit sum 21.