The number 48599
48599 is a composite number with 4 divisors. Its prime factorisation is 23 × 2113. Divisors (4): 1, 23, 2113, 48599.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48599: a semiprime: 23 × 2113, the product of two primes.
- 2
48599 is composite. Its prime factorisation is
- 3
The divisors add up to 50736; without 48599 itself that is 2137, so 48599 is deficient (2137 is less than 48599). Euler's totient φ(48599) = 46464 numbers up to 48599 share no factor with it.
- 4
The digits of 48599 add up to 35, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48599 = 23 \times 2113 \]
48599 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50736 |
| Euler totient φ(n) | 46464 |
| Square | 2361862801 |
| Cube | 114784170265799 |
| Square root | 220.451809 |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8599 × |
48599 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and ninety-nine |
| Binary (base 2) | 1011110111010111 |
| Octal (base 8) | 136727 |
| Hexadecimal (base 16) | BDD7 |
| Base 3 | 2110122222 |
| As time | 48599 seconds = 13 h 29 min 59 s |
Is 48599 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 | No (remainder 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 8) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48599 a prime number?
No. 48599 = 23 × 2113, so it is divisible by 23.
What are the factors of 48599?
1, 23, 2113, 48599.
What is 48599 in binary?
1011110111010111 (hexadecimal BDD7, octal 136727).
What is the square root of 48599?
About 220.4518.
Is 48599 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 48599?
48599 is a semiprime: 23 × 2113, the product of two primes.