The number 67951
67951 is a composite number with 4 divisors. Its prime factorisation is 13 × 5227. Divisors (4): 1, 13, 5227, 67951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 67951: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 5227, the product of two primes.
- 2
67951 is composite. Its prime factorisation is
- 3
The divisors add up to 73192; without 67951 itself that is 5241, so 67951 is deficient (5241 is less than 67951). Euler's totient φ(67951) = 62712 numbers up to 67951 share no factor with it.
- 4
The digits of 67951 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 112 steps to reach 1.
LaTeX source of the formulas on this page
\[ 67951 = 13 \times 5227 \]
67951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 73192 |
| Euler totient φ(n) | 62712 |
| Square | 4617338401 |
| Cube | 313752761686351 |
| Square root | 260.674126 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 112 |
| Scientific notation | 6.7951 × |
67951 in other forms
| Form | Value |
|---|---|
| In words | sixty-seven thousand nine hundred and fifty-one |
| Binary (base 2) | 10000100101101111 |
| Octal (base 8) | 204557 |
| Hexadecimal (base 16) | 1096F |
| Base 3 | 10110012201 |
| As time | 67951 seconds = 18 h 52 min 31 s |
Is 67951 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 67951 a prime number?
No. 67951 = 13 × 5227, so it is divisible by 13.
What are the factors of 67951?
1, 13, 5227, 67951.
What is 67951 in binary?
10000100101101111 (hexadecimal 1096F, octal 204557).
What is the square root of 67951?
About 260.6741.
Is 67951 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 67951?
67951 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 5227, the product of two primes.