The number 69363
69363 is a composite number with 16 divisors. Its prime factorisation is × 7 × 367. Divisors (16): 1, 3, 7, 9, 21, 27, 63, 189, 367, 1101, 2569, 3303, 7707, 9909, 23121, 69363.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69363: a Harshad number: divisible by its digit sum 27.
- 2
69363 is composite. Its prime factorisation is
- 3
The divisors add up to 117760; without 69363 itself that is 48397, so 69363 is deficient (48397 is less than 69363). Euler's totient φ(69363) = 39528 numbers up to 69363 share no factor with it.
- 4
The digits of 69363 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 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69363 = 3^{3} \times 7 \times 367 \]69363 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 117760 |
| Euler totient φ(n) | 39528 |
| Square | 4811225769 |
| Cube | 333721053015147 |
| Square root | 263.368563 (= 3√7707) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 68 |
| Scientific notation | 6.9363 × |
69363 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand three hundred and sixty-three |
| Binary (base 2) | 10000111011110011 |
| Octal (base 8) | 207363 |
| Hexadecimal (base 16) | 10EF3 |
| Base 3 | 10112011000 |
| As time | 69363 seconds = 19 h 16 min 3 s |
Is 69363 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 (69363 ÷ 3 = 23121) | 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 | Yes (69363 ÷ 7 = 9909) | 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 | Yes (69363 ÷ 9 = 7707) | 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 69363 a prime number?
No. 69363 = × 7 × 367, so it is divisible by 3.
What are the factors of 69363?
1, 3, 7, 9, 21, 27, 63, 189, 367, 1101, 2569, 3303, 7707, 9909, 23121, 69363.
What is 69363 in binary?
10000111011110011 (hexadecimal 10EF3, octal 207363).
What is the square root of 69363?
About 263.3686, exactly 3√7707.
Is 69363 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 69363?
69363 is a Harshad number: divisible by its digit sum 27.