The number 53131
53131 is a composite number with 8 divisors. Its prime factorisation is 13 × 61 × 67. Divisors (8): 1, 13, 61, 67, 793, 871, 4087, 53131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53131: a Harshad number: divisible by its digit sum 13.
- 2
53131 is composite. Its prime factorisation is
- 3
The divisors add up to 59024; without 53131 itself that is 5893, so 53131 is deficient (5893 is less than 53131). Euler's totient φ(53131) = 47520 numbers up to 53131 share no factor with it.
- 4
The digits of 53131 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53131 = 13 \times 61 \times 67 \]
53131 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 59024 |
| Euler totient φ(n) | 47520 |
| Square | 2822903161 |
| Cube | 149983667847091 |
| Square root | 230.501627 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3131 × |
53131 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand one hundred and thirty-one |
| Binary (base 2) | 1100111110001011 |
| Octal (base 8) | 147613 |
| Hexadecimal (base 16) | CF8B |
| Base 3 | 2200212211 |
| As time | 53131 seconds = 14 h 45 min 31 s |
Is 53131 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 3) | 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 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53131 a prime number?
No. 53131 = 13 × 61 × 67, so it is divisible by 13.
What are the factors of 53131?
1, 13, 61, 67, 793, 871, 4087, 53131.
What is 53131 in binary?
1100111110001011 (hexadecimal CF8B, octal 147613).
What is the square root of 53131?
About 230.5016.
Is 53131 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 53131?
53131 is a Harshad number: divisible by its digit sum 13.