The number 69483
69483 is a composite number with 16 divisors. Its prime factorisation is 3 × 19 × 23 × 53. Divisors (16): 1, 3, 19, 23, 53, 57, 69, 159, 437, 1007, 1219, 1311, 3021, 3657, 23161, 69483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69483 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69483 is composite. Its prime factorisation is
- 3
The divisors add up to 103680; without 69483 itself that is 34197, so 69483 is deficient (34197 is less than 69483). Euler's totient φ(69483) = 41184 numbers up to 69483 share no factor with it.
- 4
The digits of 69483 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69483 = 3 \times 19 \times 23 \times 53 \]
69483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 103680 |
| Euler totient φ(n) | 41184 |
| Square | 4827887289 |
| Cube | 335456092501587 |
| Square root | 263.596282 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 174 |
| Scientific notation | 6.9483 × |
69483 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand four hundred and eighty-three |
| Binary (base 2) | 10000111101101011 |
| Octal (base 8) | 207553 |
| Hexadecimal (base 16) | 10F6B |
| Base 3 | 10112022110 |
| As time | 69483 seconds = 19 h 18 min 3 s |
Is 69483 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 (69483 ÷ 3 = 23161) | 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 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 7) | 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 69483 a prime number?
No. 69483 = 3 × 19 × 23 × 53, so it is divisible by 3.
What are the factors of 69483?
1, 3, 19, 23, 53, 57, 69, 159, 437, 1007, 1219, 1311, 3021, 3657, 23161, 69483.
What is 69483 in binary?
10000111101101011 (hexadecimal 10F6B, octal 207553).
What is the square root of 69483?
About 263.5963.
Is 69483 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 69483?
It is a composite number with 16 divisors.