The number 22951
22951 is a composite number with 4 divisors. Its prime factorisation is 59 × 389. Divisors (4): 1, 59, 389, 22951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 22951: a semiprime: 59 × 389, the product of two primes.
- 2
22951 is composite. Its prime factorisation is
- 3
The divisors add up to 23400; without 22951 itself that is 449, so 22951 is deficient (449 is less than 22951). Euler's totient φ(22951) = 22504 numbers up to 22951 share no factor with it.
- 4
The digits of 22951 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 69 steps to reach 1.
LaTeX source of the formulas on this page
\[ 22951 = 59 \times 389 \]
22951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 23400 |
| Euler totient φ(n) | 22504 |
| Square | 526748401 |
| Cube | 12089402551351 |
| Square root | 151.495875 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 69 |
| Scientific notation | 2.2951 × |
22951 in other forms
| Form | Value |
|---|---|
| In words | twenty-two thousand nine hundred and fifty-one |
| Binary (base 2) | 101100110100111 |
| Octal (base 8) | 54647 |
| Hexadecimal (base 16) | 59A7 |
| Base 3 | 1011111001 |
| As time | 22951 seconds = 6 h 22 min 31 s |
Is 22951 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 5) | 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 5) | 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 22951 a prime number?
No. 22951 = 59 × 389, so it is divisible by 59.
What are the factors of 22951?
1, 59, 389, 22951.
What is 22951 in binary?
101100110100111 (hexadecimal 59A7, octal 54647).
What is the square root of 22951?
About 151.4959.
Is 22951 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 22951?
22951 is a semiprime: 59 × 389, the product of two primes.