The number 69701
69701 is a composite number with 4 divisors. Its prime factorisation is 47 × 1483. Divisors (4): 1, 47, 1483, 69701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69701: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1483, the product of two primes.
- 2
69701 is composite. Its prime factorisation is
- 3
The divisors add up to 71232; without 69701 itself that is 1531, so 69701 is deficient (1531 is less than 69701). Euler's totient φ(69701) = 68172 numbers up to 69701 share no factor with it.
- 4
The digits of 69701 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 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69701 = 47 \times 1483 \]
69701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 71232 |
| Euler totient φ(n) | 68172 |
| Square | 4858229401 |
| Cube | 338623447479101 |
| Square root | 264.009470 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 143 |
| Scientific notation | 6.9701 × |
69701 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand seven hundred and one |
| Binary (base 2) | 10001000001000101 |
| Octal (base 8) | 210105 |
| Hexadecimal (base 16) | 11045 |
| Base 3 | 10112121112 |
| As time | 69701 seconds = 19 h 21 min 41 s |
Is 69701 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 5) | 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 | No (remainder 5) | 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 69701 a prime number?
No. 69701 = 47 × 1483, so it is divisible by 47.
What are the factors of 69701?
1, 47, 1483, 69701.
What is 69701 in binary?
10001000001000101 (hexadecimal 11045, octal 210105).
What is the square root of 69701?
About 264.0095.
Is 69701 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 69701?
69701 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1483, the product of two primes.