The number 69901
69901 is a composite number with 8 divisors. Its prime factorisation is 13 × 19 × 283. Divisors (8): 1, 13, 19, 247, 283, 3679, 5377, 69901.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69901 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69901 is composite. Its prime factorisation is
- 3
The divisors add up to 79520; without 69901 itself that is 9619, so 69901 is deficient (9619 is less than 69901). Euler's totient φ(69901) = 60912 numbers up to 69901 share no factor with it.
- 4
The digits of 69901 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69901 = 13 \times 19 \times 283 \]
69901 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 79520 |
| Euler totient φ(n) | 60912 |
| Square | 4886149801 |
| Cube | 341546757239701 |
| Square root | 264.387972 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 143 |
| Scientific notation | 6.9901 × |
69901 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand nine hundred and one |
| Binary (base 2) | 10001000100001101 |
| Octal (base 8) | 210415 |
| Hexadecimal (base 16) | 1110D |
| Base 3 | 10112212221 |
| As time | 69901 seconds = 19 h 25 min 1 s |
Is 69901 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 1) | 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 | No (remainder 6) | 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 7) | 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 7) | 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 69901 a prime number?
No. 69901 = 13 × 19 × 283, so it is divisible by 13.
What are the factors of 69901?
1, 13, 19, 247, 283, 3679, 5377, 69901.
What is 69901 in binary?
10001000100001101 (hexadecimal 1110D, octal 210415).
What is the square root of 69901?
About 264.3880.
Is 69901 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 69901?
It is a composite number with 8 divisors.