The number 4670
4670 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 467. Divisors (8): 1, 2, 5, 10, 467, 934, 2335, 4670.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4670 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4670 is composite. Its prime factorisation is
- 3
The divisors add up to 8424; without 4670 itself that is 3754, so 4670 is deficient (3754 is less than 4670). Euler's totient φ(4670) = 1864 numbers up to 4670 share no factor with it.
- 4
The digits of 4670 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 90 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4670 = 2 \times 5 \times 467 \]
4670 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 8424 |
| Euler totient φ(n) | 1864 |
| Square | 21808900 |
| Cube | 101847563000 |
| Square root | 68.337398 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 90 |
| Scientific notation | 4.67 × |
4670 in other forms
| Form | Value |
|---|---|
| In words | four thousand six hundred and seventy |
| Binary (base 2) | 1001000111110 |
| Octal (base 8) | 11076 |
| Hexadecimal (base 16) | 123E |
| Base 3 | 20101222 |
| As time | 4670 seconds = 1 h 17 min 50 s |
Is 4670 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4670 ÷ 2 = 2335) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (4670 ÷ 5 = 934) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (4670 ÷ 10 = 467) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4670 a prime number?
No. 4670 = 2 × 5 × 467, so it is divisible by 2.
What are the factors of 4670?
1, 2, 5, 10, 467, 934, 2335, 4670.
What is 4670 in binary?
1001000111110 (hexadecimal 123E, octal 11076).
What is the square root of 4670?
About 68.3374.
Is 4670 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 4670?
It is a composite number with 8 divisors.