The number 6253
6253 is a composite number with 6 divisors. Its prime factorisation is Ć 37. Divisors (6): 1, 13, 37, 169, 481, 6253.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
6253 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
6253 is composite. Its prime factorisation is
- 3
The divisors add up to 6954; without 6253 itself that is 701, so 6253 is deficient (701 is less than 6253). Euler's totient Ļ(6253) = 5616 numbers up to 6253 share no factor with it.
- 4
The digits of 6253 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 155 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6253 = 13^{2} \times 37 \]6253 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 6954 |
| Euler totient Ļ(n) | 5616 |
| Square | 39100009 |
| Cube | 244492356277 |
| Square root | 79.075913 (= 13ā37) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 155 |
| Scientific notation | 6.253 Ć |
6253 in other forms
| Form | Value |
|---|---|
| In words | six thousand two hundred and fifty-three |
| Binary (base 2) | 1100001101101 |
| Octal (base 8) | 14155 |
| Hexadecimal (base 16) | 186D |
| Base 3 | 22120121 |
| As time | 6253 seconds = 1 h 44 min 13 s |
Is 6253 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 | No (remainder 1) | 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 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6253 a prime number?
No. 6253 = Ć 37, so it is divisible by 13.
What are the factors of 6253?
1, 13, 37, 169, 481, 6253.
What is 6253 in binary?
1100001101101 (hexadecimal 186D, octal 14155).
What is the square root of 6253?
About 79.0759, exactly 13ā37.
Is 6253 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 6253?
It is a composite number with 6 divisors.