The number 69495
69495 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 41 × 113. Divisors (16): 1, 3, 5, 15, 41, 113, 123, 205, 339, 565, 615, 1695, 4633, 13899, 23165, 69495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69495: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
69495 is composite. Its prime factorisation is
- 3
The divisors add up to 114912; without 69495 itself that is 45417, so 69495 is deficient (45417 is less than 69495). Euler's totient φ(69495) = 35840 numbers up to 69495 share no factor with it.
- 4
The digits of 69495 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 112 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69495 = 3 \times 5 \times 41 \times 113 \]
69495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 114912 |
| Euler totient φ(n) | 35840 |
| Square | 4829555025 |
| Cube | 335629926462375 |
| Square root | 263.619043 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 112 |
| Scientific notation | 6.9495 × |
69495 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand four hundred and ninety-five |
| Binary (base 2) | 10000111101110111 |
| Octal (base 8) | 207567 |
| Hexadecimal (base 16) | 10F77 |
| Base 3 | 10112022220 |
| As time | 69495 seconds = 19 h 18 min 15 s |
Is 69495 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 (69495 ÷ 3 = 23165) | 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 (69495 ÷ 5 = 13899) | 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 | No (remainder 6) | 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 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 69495 a prime number?
No. 69495 = 3 × 5 × 41 × 113, so it is divisible by 3.
What are the factors of 69495?
1, 3, 5, 15, 41, 113, 123, 205, 339, 565, 615, 1695, 4633, 13899, 23165, 69495.
What is 69495 in binary?
10000111101110111 (hexadecimal 10F77, octal 207567).
What is the square root of 69495?
About 263.6190.
Is 69495 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 69495?
69495 is a happy number: repeatedly adding the squares of its digits reaches 1.