The number 5131
5131 is a composite number with 4 divisors. Its prime factorisation is 7 × 733. Divisors (4): 1, 7, 733, 5131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5131: a semiprime: 7 × 733, the product of two primes.
- 2
5131 is composite. Its prime factorisation is
- 3
The divisors add up to 5872; without 5131 itself that is 741, so 5131 is deficient (741 is less than 5131). Euler's totient φ(5131) = 4392 numbers up to 5131 share no factor with it.
- 4
The digits of 5131 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5131 = 7 \times 733 \]
5131 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5872 |
| Euler totient φ(n) | 4392 |
| Square | 26327161 |
| Cube | 135084663091 |
| Square root | 71.630999 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 54 |
| Scientific notation | 5.131 × |
5131 in other forms
| Form | Value |
|---|---|
| In words | five thousand one hundred and thirty-one |
| Binary (base 2) | 1010000001011 |
| Octal (base 8) | 12013 |
| Hexadecimal (base 16) | 140B |
| Base 3 | 21001001 |
| As time | 5131 seconds = 1 h 25 min 31 s |
Is 5131 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 | Yes (5131 ÷ 7 = 733) | 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 1) | 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 5) | 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 5131 a prime number?
No. 5131 = 7 × 733, so it is divisible by 7.
What are the factors of 5131?
1, 7, 733, 5131.
What is 5131 in binary?
1010000001011 (hexadecimal 140B, octal 12013).
What is the square root of 5131?
About 71.6310.
Is 5131 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 5131?
5131 is a semiprime: 7 × 733, the product of two primes.