The number 48399
48399 is a composite number with 16 divisors. Its prime factorisation is 3 × 13 × 17 × 73. Divisors (16): 1, 3, 13, 17, 39, 51, 73, 219, 221, 663, 949, 1241, 2847, 3723, 16133, 48399.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48399 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48399 is composite. Its prime factorisation is
- 3
The divisors add up to 74592; without 48399 itself that is 26193, so 48399 is deficient (26193 is less than 48399). Euler's totient φ(48399) = 27648 numbers up to 48399 share no factor with it.
- 4
The digits of 48399 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48399 = 3 \times 13 \times 17 \times 73 \]
48399 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 74592 |
| Euler totient φ(n) | 27648 |
| Square | 2342463201 |
| Cube | 113372876465199 |
| Square root | 219.997727 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.8399 × |
48399 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and ninety-nine |
| Binary (base 2) | 1011110100001111 |
| Octal (base 8) | 136417 |
| Hexadecimal (base 16) | BD0F |
| Base 3 | 2110101120 |
| As time | 48399 seconds = 13 h 26 min 39 s |
Is 48399 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 (48399 ÷ 3 = 16133) | 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 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 7) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 48399 a prime number?
No. 48399 = 3 × 13 × 17 × 73, so it is divisible by 3.
What are the factors of 48399?
1, 3, 13, 17, 39, 51, 73, 219, 221, 663, 949, 1241, 2847, 3723, 16133, 48399.
What is 48399 in binary?
1011110100001111 (hexadecimal BD0F, octal 136417).
What is the square root of 48399?
About 219.9977.
Is 48399 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 48399?
It is a composite number with 16 divisors.