The number 6953
6953 is a composite number with 4 divisors. Its prime factorisation is 17 × 409. Divisors (4): 1, 17, 409, 6953.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6953: a semiprime: 17 × 409, the product of two primes.
- 2
6953 is composite. Its prime factorisation is
- 3
The divisors add up to 7380; without 6953 itself that is 427, so 6953 is deficient (427 is less than 6953). Euler's totient φ(6953) = 6528 numbers up to 6953 share no factor with it.
- 4
The digits of 6953 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6953 = 17 \times 409 \]
6953 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7380 |
| Euler totient φ(n) | 6528 |
| Square | 48344209 |
| Cube | 336137285177 |
| Square root | 83.384651 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 88 |
| Scientific notation | 6.953 × |
6953 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and fifty-three |
| Binary (base 2) | 1101100101001 |
| Octal (base 8) | 15451 |
| Hexadecimal (base 16) | 1B29 |
| Base 3 | 100112112 |
| As time | 6953 seconds = 1 h 55 min 53 s |
Is 6953 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 | No (remainder 3) | 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 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 1) | 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 3) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6953 a prime number?
No. 6953 = 17 × 409, so it is divisible by 17.
What are the factors of 6953?
1, 17, 409, 6953.
What is 6953 in binary?
1101100101001 (hexadecimal 1B29, octal 15451).
What is the square root of 6953?
About 83.3847.
Is 6953 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 6953?
6953 is a semiprime: 17 × 409, the product of two primes.