The number 4953
4953 is a binary palindrome (1001101011001). Its prime factorisation is 3 × 13 × 127. Divisors (8): 1, 3, 13, 39, 127, 381, 1651, 4953.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4953: a binary palindrome (1001101011001).
- 2
4953 is composite. Its prime factorisation is
- 3
The divisors add up to 7168; without 4953 itself that is 2215, so 4953 is deficient (2215 is less than 4953). Euler's totient φ(4953) = 3024 numbers up to 4953 share no factor with it.
- 4
The digits of 4953 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4953 = 3 \times 13 \times 127 \]
4953 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 7168 |
| Euler totient φ(n) | 3024 |
| Square | 24532209 |
| Cube | 121508031177 |
| Square root | 70.377553 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 41 |
| Scientific notation | 4.953 × |
4953 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and fifty-three |
| Binary (base 2) | 1001101011001 |
| Octal (base 8) | 11531 |
| Hexadecimal (base 16) | 1359 |
| Base 3 | 20210110 |
| As time | 4953 seconds = 1 h 22 min 33 s |
Is 4953 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 (4953 ÷ 3 = 1651) | 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 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 1) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 4953 a prime number?
No. 4953 = 3 × 13 × 127, so it is divisible by 3.
What are the factors of 4953?
1, 3, 13, 39, 127, 381, 1651, 4953.
What is 4953 in binary?
1001101011001 (hexadecimal 1359, octal 11531).
What is the square root of 4953?
About 70.3776.
Is 4953 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 4953?
4953 is a binary palindrome (1001101011001).