The number 90003
90003 is a composite number with 8 divisors. Its prime factorisation is 3 × 19 × 1579. Divisors (8): 1, 3, 19, 57, 1579, 4737, 30001, 90003.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90003 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90003 is composite. Its prime factorisation is
- 3
The divisors add up to 126400; without 90003 itself that is 36397, so 90003 is deficient (36397 is less than 90003). Euler's totient φ(90003) = 56808 numbers up to 90003 share no factor with it.
- 4
The digits of 90003 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 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90003 = 3 \times 19 \times 1579 \]
90003 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 126400 |
| Euler totient φ(n) | 56808 |
| Square | 8100540009 |
| Cube | 729072902430027 |
| Square root | 300.005000 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 63 |
| Scientific notation | 9.0003 × |
90003 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand and three |
| Binary (base 2) | 10101111110010011 |
| Octal (base 8) | 257623 |
| Hexadecimal (base 16) | 15F93 |
| Base 3 | 11120110110 |
| As time | 90003 seconds = 25 h 0 min 3 s |
Is 90003 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 (90003 ÷ 3 = 30001) | 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 4) | 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 3) | 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 90003 a prime number?
No. 90003 = 3 × 19 × 1579, so it is divisible by 3.
What are the factors of 90003?
1, 3, 19, 57, 1579, 4737, 30001, 90003.
What is 90003 in binary?
10101111110010011 (hexadecimal 15F93, octal 257623).
What is the square root of 90003?
About 300.0050.
Is 90003 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 90003?
It is a composite number with 8 divisors.