The number 69271
69271 is a composite number with 4 divisors. Its prime factorisation is 53 × 1307. Divisors (4): 1, 53, 1307, 69271.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69271: a semiprime: 53 × 1307, the product of two primes.
- 2
69271 is composite. Its prime factorisation is
- 3
The divisors add up to 70632; without 69271 itself that is 1361, so 69271 is deficient (1361 is less than 69271). Euler's totient φ(69271) = 67912 numbers up to 69271 share no factor with it.
- 4
The digits of 69271 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
\[ 69271 = 53 \times 1307 \]
69271 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 70632 |
| Euler totient φ(n) | 67912 |
| Square | 4798471441 |
| Cube | 332394915189511 |
| Square root | 263.193845 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 143 |
| Scientific notation | 6.9271 × |
69271 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand two hundred and seventy-one |
| Binary (base 2) | 10000111010010111 |
| Octal (base 8) | 207227 |
| Hexadecimal (base 16) | 10E97 |
| Base 3 | 10112000121 |
| As time | 69271 seconds = 19 h 14 min 31 s |
Is 69271 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 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 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 7) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69271 a prime number?
No. 69271 = 53 × 1307, so it is divisible by 53.
What are the factors of 69271?
1, 53, 1307, 69271.
What is 69271 in binary?
10000111010010111 (hexadecimal 10E97, octal 207227).
What is the square root of 69271?
About 263.1938.
Is 69271 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 69271?
69271 is a semiprime: 53 × 1307, the product of two primes.