The number 4690
4690 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 7 × 67. Divisors (16): 1, 2, 5, 7, 10, 14, 35, 67, 70, 134, 335, 469, 670, 938, 2345, 4690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4690: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
4690 is composite. Its prime factorisation is
- 3
The divisors add up to 9792; without 4690 itself that is 5102, so 4690 is abundant (5102 is more than 4690). Euler's totient φ(4690) = 1584 numbers up to 4690 share no factor with it.
- 4
The digits of 4690 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 152 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4690 = 2 \times 5 \times 7 \times 67 \]
4690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 9792 |
| Euler totient φ(n) | 1584 |
| Square | 21996100 |
| Cube | 103161709000 |
| Square root | 68.483575 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 152 |
| Scientific notation | 4.69 × |
4690 in other forms
| Form | Value |
|---|---|
| In words | four thousand six hundred and ninety |
| Binary (base 2) | 1001001010010 |
| Octal (base 8) | 11122 |
| Hexadecimal (base 16) | 1252 |
| Base 3 | 20102201 |
| As time | 4690 seconds = 1 h 18 min 10 s |
Is 4690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4690 ÷ 2 = 2345) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (4690 ÷ 5 = 938) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (4690 ÷ 7 = 670) | 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 2) | 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 | Yes (4690 ÷ 10 = 469) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4690 a prime number?
No. 4690 = 2 × 5 × 7 × 67, so it is divisible by 2.
What are the factors of 4690?
1, 2, 5, 7, 10, 14, 35, 67, 70, 134, 335, 469, 670, 938, 2345, 4690.
What is 4690 in binary?
1001001010010 (hexadecimal 1252, octal 11122).
What is the square root of 4690?
About 68.4836.
Is 4690 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 4690?
4690 is a happy number: repeatedly adding the squares of its digits reaches 1.