The number 99063
99063 is a composite number with 10 divisors. Its prime factorisation is × 1223. Divisors (10): 1, 3, 9, 27, 81, 1223, 3669, 11007, 33021, 99063.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 99063: a Harshad number: divisible by its digit sum 27.
- 2
99063 is composite. Its prime factorisation is
- 3
The divisors add up to 148104; without 99063 itself that is 49041, so 99063 is deficient (49041 is less than 99063). Euler's totient φ(99063) = 65988 numbers up to 99063 share no factor with it.
- 4
The digits of 99063 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 172 steps to reach 1.
LaTeX source of the formulas on this page
\[ 99063 = 3^{4} \times 1223 \]99063 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 148104 |
| Euler totient φ(n) | 65988 |
| Square | 9813477969 |
| Cube | 972152568043047 |
| Square root | 314.742752 (= 9√1223) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 172 |
| Scientific notation | 9.9063 × |
99063 in other forms
| Form | Value |
|---|---|
| In words | ninety-nine thousand and sixty-three |
| Binary (base 2) | 11000001011110111 |
| Octal (base 8) | 301367 |
| Hexadecimal (base 16) | 182F7 |
| Base 3 | 12000220000 |
| As time | 99063 seconds = 27 h 31 min 3 s |
Is 99063 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 (99063 ÷ 3 = 33021) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (99063 ÷ 9 = 11007) | 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 8) | 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 99063 a prime number?
No. 99063 = × 1223, so it is divisible by 3.
What are the factors of 99063?
1, 3, 9, 27, 81, 1223, 3669, 11007, 33021, 99063.
What is 99063 in binary?
11000001011110111 (hexadecimal 182F7, octal 301367).
What is the square root of 99063?
About 314.7428, exactly 9√1223.
Is 99063 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 99063?
99063 is a Harshad number: divisible by its digit sum 27.