The number 48701
48701 is a composite number with 4 divisors. Its prime factorisation is 31 × 1571. Divisors (4): 1, 31, 1571, 48701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48701: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 31 × 1571, the product of two primes.
- 2
48701 is composite. Its prime factorisation is
- 3
The divisors add up to 50304; without 48701 itself that is 1603, so 48701 is deficient (1603 is less than 48701). Euler's totient φ(48701) = 47100 numbers up to 48701 share no factor with it.
- 4
The digits of 48701 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48701 = 31 \times 1571 \]
48701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50304 |
| Euler totient φ(n) | 47100 |
| Square | 2371787401 |
| Cube | 115508418216101 |
| Square root | 220.683031 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8701 × |
48701 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand seven hundred and one |
| Binary (base 2) | 1011111000111101 |
| Octal (base 8) | 137075 |
| Hexadecimal (base 16) | BE3D |
| Base 3 | 2110210202 |
| As time | 48701 seconds = 13 h 31 min 41 s |
Is 48701 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48701 a prime number?
No. 48701 = 31 × 1571, so it is divisible by 31.
What are the factors of 48701?
1, 31, 1571, 48701.
What is 48701 in binary?
1011111000111101 (hexadecimal BE3D, octal 137075).
What is the square root of 48701?
About 220.6830.
Is 48701 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 48701?
48701 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 31 × 1571, the product of two primes.