The number 48099
48099 is a composite number with 4 divisors. Its prime factorisation is 3 × 16033. Divisors (4): 1, 3, 16033, 48099.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48099: a semiprime: 3 × 16033, the product of two primes.
- 2
48099 is composite. Its prime factorisation is
- 3
The divisors add up to 64136; without 48099 itself that is 16037, so 48099 is deficient (16037 is less than 48099). Euler's totient φ(48099) = 32064 numbers up to 48099 share no factor with it.
- 4
The digits of 48099 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48099 = 3 \times 16033 \]
48099 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 64136 |
| Euler totient φ(n) | 32064 |
| Square | 2313513801 |
| Cube | 111277700314299 |
| Square root | 219.314842 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.8099 × |
48099 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand and ninety-nine |
| Binary (base 2) | 1011101111100011 |
| Octal (base 8) | 135743 |
| Hexadecimal (base 16) | BBE3 |
| Base 3 | 2102222110 |
| As time | 48099 seconds = 13 h 21 min 39 s |
Is 48099 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 (48099 ÷ 3 = 16033) | 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 | 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 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 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48099 a prime number?
No. 48099 = 3 × 16033, so it is divisible by 3.
What are the factors of 48099?
1, 3, 16033, 48099.
What is 48099 in binary?
1011101111100011 (hexadecimal BBE3, octal 135743).
What is the square root of 48099?
About 219.3148.
Is 48099 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 48099?
48099 is a semiprime: 3 × 16033, the product of two primes.