The number 3953
3953 is a composite number with 4 divisors. Its prime factorisation is 59 × 67. Divisors (4): 1, 59, 67, 3953.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3953: a semiprime: 59 × 67, the product of two primes.
- 2
3953 is composite. Its prime factorisation is
- 3
The divisors add up to 4080; without 3953 itself that is 127, so 3953 is deficient (127 is less than 3953). Euler's totient φ(3953) = 3828 numbers up to 3953 share no factor with it.
- 4
The digits of 3953 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 51 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3953 = 59 \times 67 \]
3953 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 4080 |
| Euler totient φ(n) | 3828 |
| Square | 15626209 |
| Cube | 61770404177 |
| Square root | 62.872888 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 51 |
| Scientific notation | 3.953 × |
3953 in other forms
| Form | Value |
|---|---|
| In words | three thousand nine hundred and fifty-three |
| Roman numerals | MMMCMLIII |
| Binary (base 2) | 111101110001 |
| Octal (base 8) | 7561 |
| Hexadecimal (base 16) | F71 |
| Base 3 | 12102102 |
| As time | 3953 seconds = 1 h 5 min 53 s |
Is 3953 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 5) | 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 2) | 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 4) | 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 3953 a prime number?
No. 3953 = 59 × 67, so it is divisible by 59.
What are the factors of 3953?
1, 59, 67, 3953.
What is 3953 in binary?
111101110001 (hexadecimal F71, octal 7561).
What is the square root of 3953?
About 62.8729.
What is 3953 in Roman numerals?
MMMCMLIII.
Is 3953 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 3953?
3953 is a semiprime: 59 × 67, the product of two primes.