The number 40503
40503 is a composite number with 8 divisors. Its prime factorisation is 3 × 23 × 587. Divisors (8): 1, 3, 23, 69, 587, 1761, 13501, 40503.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
40503 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
40503 is composite. Its prime factorisation is
- 3
The divisors add up to 56448; without 40503 itself that is 15945, so 40503 is deficient (15945 is less than 40503). Euler's totient φ(40503) = 25784 numbers up to 40503 share no factor with it.
- 4
The digits of 40503 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 212 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40503 = 3 \times 23 \times 587 \]
40503 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 56448 |
| Euler totient φ(n) | 25784 |
| Square | 1640493009 |
| Cube | 66444888343527 |
| Square root | 201.253571 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 212 |
| Scientific notation | 4.0503 × |
40503 in other forms
| Form | Value |
|---|---|
| In words | forty thousand five hundred and three |
| Binary (base 2) | 1001111000110111 |
| Octal (base 8) | 117067 |
| Hexadecimal (base 16) | 9E37 |
| Base 3 | 2001120010 |
| As time | 40503 seconds = 11 h 15 min 3 s |
Is 40503 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 (40503 ÷ 3 = 13501) | 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 1) | 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 3) | 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 1) | 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 40503 a prime number?
No. 40503 = 3 × 23 × 587, so it is divisible by 3.
What are the factors of 40503?
1, 3, 23, 69, 587, 1761, 13501, 40503.
What is 40503 in binary?
1001111000110111 (hexadecimal 9E37, octal 117067).
What is the square root of 40503?
About 201.2536.
Is 40503 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 40503?
It is a composite number with 8 divisors.