The number 4601
4601 is a composite number with 4 divisors. Its prime factorisation is 43 × 107. Divisors (4): 1, 43, 107, 4601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4601: a semiprime: 43 × 107, the product of two primes.
- 2
4601 is composite. Its prime factorisation is
- 3
The divisors add up to 4752; without 4601 itself that is 151, so 4601 is deficient (151 is less than 4601). Euler's totient φ(4601) = 4452 numbers up to 4601 share no factor with it.
- 4
The digits of 4601 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4601 = 43 \times 107 \]
4601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 4752 |
| Euler totient φ(n) | 4452 |
| Square | 21169201 |
| Cube | 97399493801 |
| Square root | 67.830672 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 59 |
| Scientific notation | 4.601 × |
4601 in other forms
| Form | Value |
|---|---|
| In words | four thousand six hundred and one |
| Binary (base 2) | 1000111111001 |
| Octal (base 8) | 10771 |
| Hexadecimal (base 16) | 11F9 |
| Base 3 | 20022102 |
| As time | 4601 seconds = 1 h 16 min 41 s |
Is 4601 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 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 5) | 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 1) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4601 a prime number?
No. 4601 = 43 × 107, so it is divisible by 43.
What are the factors of 4601?
1, 43, 107, 4601.
What is 4601 in binary?
1000111111001 (hexadecimal 11F9, octal 10771).
What is the square root of 4601?
About 67.8307.
Is 4601 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 4601?
4601 is a semiprime: 43 × 107, the product of two primes.