The number 68476
68476 is a composite number with 24 divisors. Its prime factorisation is × 17 × 19 × 53. Divisors (24): 1, 2, 4, 17, 19, 34, 38, 53, 68, 76, 106, 212, 323, 646, 901, 1007 … 68476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
68476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
68476 is composite. Its prime factorisation is
- 3
The divisors add up to 136080; without 68476 itself that is 67604, so 68476 is deficient (67604 is less than 68476). Euler's totient φ(68476) = 29952 numbers up to 68476 share no factor with it.
- 4
The digits of 68476 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68476 = 2^{2} \times 17 \times 19 \times 53 \]68476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 136080 |
| Euler totient φ(n) | 29952 |
| Square | 4688962576 |
| Cube | 321081401354176 |
| Square root | 261.679193 (= 2√17119) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 81 |
| Scientific notation | 6.8476 × |
68476 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand four hundred and seventy-six |
| Binary (base 2) | 10000101101111100 |
| Octal (base 8) | 205574 |
| Hexadecimal (base 16) | 10B7C |
| Base 3 | 10110221011 |
| As time | 68476 seconds = 19 h 1 min 16 s |
Is 68476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68476 ÷ 2 = 34238) | 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 | Yes (68476 ÷ 4 = 17119) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 68476 a prime number?
No. 68476 = × 17 × 19 × 53, so it is divisible by 2.
What are the factors of 68476?
1, 2, 4, 17, 19, 34, 38, 53, 68, 76, 106, 212, 323, 646, 901, 1007, 1292, 1802, 2014, 3604, 4028, 17119, 34238, 68476.
What is 68476 in binary?
10000101101111100 (hexadecimal 10B7C, octal 205574).
What is the square root of 68476?
About 261.6792, exactly 2√17119.
Is 68476 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 68476?
It is a composite number with 24 divisors.