The number 48503
48503 is a composite number with 12 divisors. Its prime factorisation is 7 × × 41. Divisors (12): 1, 7, 13, 41, 91, 169, 287, 533, 1183, 3731, 6929, 48503.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48503 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48503 is composite. Its prime factorisation is
- 3
The divisors add up to 61488; without 48503 itself that is 12985, so 48503 is deficient (12985 is less than 48503). Euler's totient φ(48503) = 37440 numbers up to 48503 share no factor with it.
- 4
The digits of 48503 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 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48503 = 7 \times 13^{2} \times 41 \]48503 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 61488 |
| Euler totient φ(n) | 37440 |
| Square | 2352541009 |
| Cube | 114105296559527 |
| Square root | 220.233966 (= 13√287) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.8503 × |
48503 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and three |
| Binary (base 2) | 1011110101110111 |
| Octal (base 8) | 136567 |
| Hexadecimal (base 16) | BD77 |
| Base 3 | 2110112102 |
| As time | 48503 seconds = 13 h 28 min 23 s |
Is 48503 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 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 (48503 ÷ 7 = 6929) | 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 2) | 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 4) | 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 48503 a prime number?
No. 48503 = 7 × × 41, so it is divisible by 7.
What are the factors of 48503?
1, 7, 13, 41, 91, 169, 287, 533, 1183, 3731, 6929, 48503.
What is 48503 in binary?
1011110101110111 (hexadecimal BD77, octal 136567).
What is the square root of 48503?
About 220.2340, exactly 13√287.
Is 48503 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 48503?
It is a composite number with 12 divisors.