The number 4906
4906 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 223. Divisors (8): 1, 2, 11, 22, 223, 446, 2453, 4906.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4906: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
4906 is composite. Its prime factorisation is
- 3
The divisors add up to 8064; without 4906 itself that is 3158, so 4906 is deficient (3158 is less than 4906). Euler's totient φ(4906) = 2220 numbers up to 4906 share no factor with it.
- 4
The digits of 4906 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 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4906 = 2 \times 11 \times 223 \]
4906 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 8064 |
| Euler totient φ(n) | 2220 |
| Square | 24068836 |
| Cube | 118081709416 |
| Square root | 70.042844 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 41 |
| Scientific notation | 4.906 × |
4906 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and six |
| Binary (base 2) | 1001100101010 |
| Octal (base 8) | 11452 |
| Hexadecimal (base 16) | 132A |
| Base 3 | 20201201 |
| As time | 4906 seconds = 1 h 21 min 46 s |
Is 4906 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4906 ÷ 2 = 2453) | 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 | No (remainder 1) | 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 | No (remainder 6) | 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 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (4906 ÷ 11 = 446) | 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 4906 a prime number?
No. 4906 = 2 × 11 × 223, so it is divisible by 2.
What are the factors of 4906?
1, 2, 11, 22, 223, 446, 2453, 4906.
What is 4906 in binary?
1001100101010 (hexadecimal 132A, octal 11452).
What is the square root of 4906?
About 70.0428.
Is 4906 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 4906?
4906 is a happy number: repeatedly adding the squares of its digits reaches 1.