The number 54695
54695 is a composite number with 4 divisors. Its prime factorisation is 5 × 10939. Divisors (4): 1, 5, 10939, 54695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 54695: a semiprime: 5 × 10939, the product of two primes.
- 2
54695 is composite. Its prime factorisation is
- 3
The divisors add up to 65640; without 54695 itself that is 10945, so 54695 is deficient (10945 is less than 54695). Euler's totient φ(54695) = 43752 numbers up to 54695 share no factor with it.
- 4
The digits of 54695 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 54695 = 5 \times 10939 \]
54695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 65640 |
| Euler totient φ(n) | 43752 |
| Square | 2991543025 |
| Cube | 163622445752375 |
| Square root | 233.869622 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.4695 × |
54695 in other forms
| Form | Value |
|---|---|
| In words | fifty-four thousand six hundred and ninety-five |
| Binary (base 2) | 1101010110100111 |
| Octal (base 8) | 152647 |
| Hexadecimal (base 16) | D5A7 |
| Base 3 | 2210000202 |
| As time | 54695 seconds = 15 h 11 min 35 s |
Is 54695 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (54695 ÷ 5 = 10939) | 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 4) | 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 2) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 54695 a prime number?
No. 54695 = 5 × 10939, so it is divisible by 5.
What are the factors of 54695?
1, 5, 10939, 54695.
What is 54695 in binary?
1101010110100111 (hexadecimal D5A7, octal 152647).
What is the square root of 54695?
About 233.8696.
Is 54695 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 54695?
54695 is a semiprime: 5 × 10939, the product of two primes.