The number 3913
3913 is a composite number with 8 divisors. Its prime factorisation is 7 × 13 × 43. Divisors (8): 1, 7, 13, 43, 91, 301, 559, 3913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3913: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
3913 is composite. Its prime factorisation is
- 3
The divisors add up to 4928; without 3913 itself that is 1015, so 3913 is deficient (1015 is less than 3913). Euler's totient φ(3913) = 3024 numbers up to 3913 share no factor with it.
- 4
The digits of 3913 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 144 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3913 = 7 \times 13 \times 43 \]
3913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 4928 |
| Euler totient φ(n) | 3024 |
| Square | 15311569 |
| Cube | 59914169497 |
| Square root | 62.553977 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 144 |
| Scientific notation | 3.913 × |
3913 in other forms
| Form | Value |
|---|---|
| In words | three thousand nine hundred and thirteen |
| Roman numerals | MMMCMXIII |
| Binary (base 2) | 111101001001 |
| Octal (base 8) | 7511 |
| Hexadecimal (base 16) | F49 |
| Base 3 | 12100221 |
| As time | 3913 seconds = 1 h 5 min 13 s |
Is 3913 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (3913 ÷ 7 = 559) | 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 7) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 3913 a prime number?
No. 3913 = 7 × 13 × 43, so it is divisible by 7.
What are the factors of 3913?
1, 7, 13, 43, 91, 301, 559, 3913.
What is 3913 in binary?
111101001001 (hexadecimal F49, octal 7511).
What is the square root of 3913?
About 62.5540.
What is 3913 in Roman numerals?
MMMCMXIII.
Is 3913 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 3913?
3913 is a happy number: repeatedly adding the squares of its digits reaches 1.