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