The number 48713
48713 is a composite number with 4 divisors. Its prime factorisation is 7 × 6959. Divisors (4): 1, 7, 6959, 48713.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48713: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 6959, the product of two primes.
- 2
48713 is composite. Its prime factorisation is
- 3
The divisors add up to 55680; without 48713 itself that is 6967, so 48713 is deficient (6967 is less than 48713). Euler's totient φ(48713) = 41748 numbers up to 48713 share no factor with it.
- 4
The digits of 48713 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48713 = 7 \times 6959 \]
48713 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 55680 |
| Euler totient φ(n) | 41748 |
| Square | 2372956369 |
| Cube | 115593823603097 |
| Square root | 220.710217 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.8713 × |
48713 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand seven hundred and thirteen |
| Binary (base 2) | 1011111001001001 |
| Octal (base 8) | 137111 |
| Hexadecimal (base 16) | BE49 |
| Base 3 | 2110211012 |
| As time | 48713 seconds = 13 h 31 min 53 s |
Is 48713 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 3) | 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 | Yes (48713 ÷ 7 = 6959) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48713 a prime number?
No. 48713 = 7 × 6959, so it is divisible by 7.
What are the factors of 48713?
1, 7, 6959, 48713.
What is 48713 in binary?
1011111001001001 (hexadecimal BE49, octal 137111).
What is the square root of 48713?
About 220.7102.
Is 48713 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 48713?
48713 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 6959, the product of two primes.