The number 69131
69131 is a composite number with 4 divisors. Its prime factorisation is 73 × 947. Divisors (4): 1, 73, 947, 69131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69131: a semiprime: 73 × 947, the product of two primes.
- 2
69131 is composite. Its prime factorisation is
- 3
The divisors add up to 70152; without 69131 itself that is 1021, so 69131 is deficient (1021 is less than 69131). Euler's totient φ(69131) = 68112 numbers up to 69131 share no factor with it.
- 4
The digits of 69131 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 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69131 = 73 \times 947 \]
69131 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 70152 |
| Euler totient φ(n) | 68112 |
| Square | 4779095161 |
| Cube | 330383627575091 |
| Square root | 262.927747 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 174 |
| Scientific notation | 6.9131 × |
69131 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand one hundred and thirty-one |
| Binary (base 2) | 10000111000001011 |
| Octal (base 8) | 207013 |
| Hexadecimal (base 16) | 10E0B |
| Base 3 | 10111211102 |
| As time | 69131 seconds = 19 h 12 min 11 s |
Is 69131 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 3) | 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 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 3) | 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 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69131 a prime number?
No. 69131 = 73 × 947, so it is divisible by 73.
What are the factors of 69131?
1, 73, 947, 69131.
What is 69131 in binary?
10000111000001011 (hexadecimal 10E0B, octal 207013).
What is the square root of 69131?
About 262.9277.
Is 69131 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 69131?
69131 is a semiprime: 73 × 947, the product of two primes.