The number 48502
48502 is a composite number with 4 divisors. Its prime factorisation is 2 × 24251. Divisors (4): 1, 2, 24251, 48502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48502: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 24251, the product of two primes.
- 2
48502 is composite. Its prime factorisation is
- 3
The divisors add up to 72756; without 48502 itself that is 24254, so 48502 is deficient (24254 is less than 48502). Euler's totient φ(48502) = 24250 numbers up to 48502 share no factor with it.
- 4
The digits of 48502 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48502 = 2 \times 24251 \]
48502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 72756 |
| Euler totient φ(n) | 24250 |
| Square | 2352444004 |
| Cube | 114098239082008 |
| Square root | 220.231696 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.8502 × |
48502 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and two |
| Binary (base 2) | 1011110101110110 |
| Octal (base 8) | 136566 |
| Hexadecimal (base 16) | BD76 |
| Base 3 | 2110112101 |
| As time | 48502 seconds = 13 h 28 min 22 s |
Is 48502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48502 ÷ 2 = 24251) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48502 a prime number?
No. 48502 = 2 × 24251, so it is divisible by 2.
What are the factors of 48502?
1, 2, 24251, 48502.
What is 48502 in binary?
1011110101110110 (hexadecimal BD76, octal 136566).
What is the square root of 48502?
About 220.2317.
Is 48502 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 48502?
48502 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 24251, the product of two primes.