The number 48009
48009 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 1231. Divisors (8): 1, 3, 13, 39, 1231, 3693, 16003, 48009.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48009 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48009 is composite. Its prime factorisation is
- 3
The divisors add up to 68992; without 48009 itself that is 20983, so 48009 is deficient (20983 is less than 48009). Euler's totient φ(48009) = 29520 numbers up to 48009 share no factor with it.
- 4
The digits of 48009 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 101 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48009 = 3 \times 13 \times 1231 \]
48009 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 68992 |
| Euler totient φ(n) | 29520 |
| Square | 2304864081 |
| Cube | 110654219664729 |
| Square root | 219.109562 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 101 |
| Scientific notation | 4.8009 × |
48009 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and nine |
| Binary (base 2) | 1011101110001001 |
| Octal (base 8) | 135611 |
| Hexadecimal (base 16) | BB89 |
| Base 3 | 2102212010 |
| As time | 48009 seconds = 13 h 20 min 9 s |
Is 48009 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 (48009 ÷ 3 = 16003) | 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 4) | 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 3) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 48009 a prime number?
No. 48009 = 3 × 13 × 1231, so it is divisible by 3.
What are the factors of 48009?
1, 3, 13, 39, 1231, 3693, 16003, 48009.
What is 48009 in binary?
1011101110001001 (hexadecimal BB89, octal 135611).
What is the square root of 48009?
About 219.1096.
Is 48009 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 48009?
It is a composite number with 8 divisors.