The number 70961
70961 is a composite number with 4 divisors. Its prime factorisation is 11 × 6451. Divisors (4): 1, 11, 6451, 70961.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 70961: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 6451, the product of two primes.
- 2
70961 is composite. Its prime factorisation is
- 3
The divisors add up to 77424; without 70961 itself that is 6463, so 70961 is deficient (6463 is less than 70961). Euler's totient φ(70961) = 64500 numbers up to 70961 share no factor with it.
- 4
The digits of 70961 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 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 70961 = 11 \times 6451 \]
70961 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 77424 |
| Euler totient φ(n) | 64500 |
| Square | 5035463521 |
| Cube | 357321526913681 |
| Square root | 266.385060 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 81 |
| Scientific notation | 7.0961 × |
70961 in other forms
| Form | Value |
|---|---|
| In words | seventy thousand nine hundred and sixty-one |
| Binary (base 2) | 10001010100110001 |
| Octal (base 8) | 212461 |
| Hexadecimal (base 16) | 11531 |
| Base 3 | 10121100012 |
| As time | 70961 seconds = 19 h 42 min 41 s |
Is 70961 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (70961 ÷ 11 = 6451) | 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 70961 a prime number?
No. 70961 = 11 × 6451, so it is divisible by 11.
What are the factors of 70961?
1, 11, 6451, 70961.
What is 70961 in binary?
10001010100110001 (hexadecimal 11531, octal 212461).
What is the square root of 70961?
About 266.3851.
Is 70961 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 70961?
70961 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 6451, the product of two primes.