The number 46503
46503 is a composite number with 6 divisors. Its prime factorisation is × 5167. Divisors (6): 1, 3, 9, 5167, 15501, 46503.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46503: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
46503 is composite. Its prime factorisation is
- 3
The divisors add up to 67184; without 46503 itself that is 20681, so 46503 is deficient (20681 is less than 46503). Euler's totient φ(46503) = 30996 numbers up to 46503 share no factor with it.
- 4
The digits of 46503 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46503 = 3^{2} \times 5167 \]46503 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 67184 |
| Euler totient φ(n) | 30996 |
| Square | 2162529009 |
| Cube | 100564086505527 |
| Square root | 215.645542 (= 3√5167) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.6503 × |
46503 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and three |
| Binary (base 2) | 1011010110100111 |
| Octal (base 8) | 132647 |
| Hexadecimal (base 16) | B5A7 |
| Base 3 | 2100210100 |
| As time | 46503 seconds = 12 h 55 min 3 s |
Is 46503 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 | Yes (46503 ÷ 3 = 15501) | 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 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (46503 ÷ 9 = 5167) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46503 a prime number?
No. 46503 = × 5167, so it is divisible by 3.
What are the factors of 46503?
1, 3, 9, 5167, 15501, 46503.
What is 46503 in binary?
1011010110100111 (hexadecimal B5A7, octal 132647).
What is the square root of 46503?
About 215.6455, exactly 3√5167.
Is 46503 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 46503?
46503 is a happy number: repeatedly adding the squares of its digits reaches 1.