The number 69485
69485 is a composite number with 8 divisors. Its prime factorisation is 5 × 13 × 1069. Divisors (8): 1, 5, 13, 65, 1069, 5345, 13897, 69485.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69485 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69485 is composite. Its prime factorisation is
- 3
The divisors add up to 89880; without 69485 itself that is 20395, so 69485 is deficient (20395 is less than 69485). Euler's totient φ(69485) = 51264 numbers up to 69485 share no factor with it.
- 4
The digits of 69485 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69485 = 5 \times 13 \times 1069 \]
69485 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 89880 |
| Euler totient φ(n) | 51264 |
| Square | 4828165225 |
| Cube | 335485060659125 |
| Square root | 263.600076 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 143 |
| Scientific notation | 6.9485 × |
69485 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand four hundred and eighty-five |
| Binary (base 2) | 10000111101101101 |
| Octal (base 8) | 207555 |
| Hexadecimal (base 16) | 10F6D |
| Base 3 | 10112022112 |
| As time | 69485 seconds = 19 h 18 min 5 s |
Is 69485 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 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (69485 ÷ 5 = 13897) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69485 a prime number?
No. 69485 = 5 × 13 × 1069, so it is divisible by 5.
What are the factors of 69485?
1, 5, 13, 65, 1069, 5345, 13897, 69485.
What is 69485 in binary?
10000111101101101 (hexadecimal 10F6D, octal 207555).
What is the square root of 69485?
About 263.6001.
Is 69485 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 69485?
It is a composite number with 8 divisors.