The number 69355
69355 is a composite number with 16 divisors. Its prime factorisation is 5 × 11 × 13 × 97. Divisors (16): 1, 5, 11, 13, 55, 65, 97, 143, 485, 715, 1067, 1261, 5335, 6305, 13871, 69355.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69355: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
69355 is composite. Its prime factorisation is
- 3
The divisors add up to 98784; without 69355 itself that is 29429, so 69355 is deficient (29429 is less than 69355). Euler's totient φ(69355) = 46080 numbers up to 69355 share no factor with it.
- 4
The digits of 69355 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69355 = 5 \times 11 \times 13 \times 97 \]
69355 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 98784 |
| Euler totient φ(n) | 46080 |
| Square | 4810116025 |
| Cube | 333605596913875 |
| Square root | 263.353375 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 130 |
| Scientific notation | 6.9355 × |
69355 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand three hundred and fifty-five |
| Binary (base 2) | 10000111011101011 |
| Octal (base 8) | 207353 |
| Hexadecimal (base 16) | 10EEB |
| Base 3 | 10112010201 |
| As time | 69355 seconds = 19 h 15 min 55 s |
Is 69355 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 1) | 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 | Yes (69355 ÷ 5 = 13871) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 | Yes (69355 ÷ 11 = 6305) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69355 a prime number?
No. 69355 = 5 × 11 × 13 × 97, so it is divisible by 5.
What are the factors of 69355?
1, 5, 11, 13, 55, 65, 97, 143, 485, 715, 1067, 1261, 5335, 6305, 13871, 69355.
What is 69355 in binary?
10000111011101011 (hexadecimal 10EEB, octal 207353).
What is the square root of 69355?
About 263.3534.
Is 69355 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 69355?
69355 is a happy number: repeatedly adding the squares of its digits reaches 1.