The number 4701
4701 is a composite number with 4 divisors. Its prime factorisation is 3 × 1567. Divisors (4): 1, 3, 1567, 4701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4701: a semiprime: 3 × 1567, the product of two primes.
- 2
4701 is composite. Its prime factorisation is
- 3
The divisors add up to 6272; without 4701 itself that is 1571, so 4701 is deficient (1571 is less than 4701). Euler's totient φ(4701) = 3132 numbers up to 4701 share no factor with it.
- 4
The digits of 4701 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 121 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4701 = 3 \times 1567 \]
4701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6272 |
| Euler totient φ(n) | 3132 |
| Square | 22099401 |
| Cube | 103889284101 |
| Square root | 68.563839 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 121 |
| Scientific notation | 4.701 × |
4701 in other forms
| Form | Value |
|---|---|
| In words | four thousand seven hundred and one |
| Binary (base 2) | 1001001011101 |
| Octal (base 8) | 11135 |
| Hexadecimal (base 16) | 125D |
| Base 3 | 20110010 |
| As time | 4701 seconds = 1 h 18 min 21 s |
Is 4701 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 | Yes (4701 ÷ 3 = 1567) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4701 a prime number?
No. 4701 = 3 × 1567, so it is divisible by 3.
What are the factors of 4701?
1, 3, 1567, 4701.
What is 4701 in binary?
1001001011101 (hexadecimal 125D, octal 11135).
What is the square root of 4701?
About 68.5638.
Is 4701 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 4701?
4701 is a semiprime: 3 × 1567, the product of two primes.