The number 5031
5031 is a composite number with 12 divisors. Its prime factorisation is × 13 × 43. Divisors (12): 1, 3, 9, 13, 39, 43, 117, 129, 387, 559, 1677, 5031.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5031: a Harshad number: divisible by its digit sum 9.
- 2
5031 is composite. Its prime factorisation is
- 3
The divisors add up to 8008; without 5031 itself that is 2977, so 5031 is deficient (2977 is less than 5031). Euler's totient φ(5031) = 3024 numbers up to 5031 share no factor with it.
- 4
The digits of 5031 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 116 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5031 = 3^{2} \times 13 \times 43 \]5031 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 8008 |
| Euler totient φ(n) | 3024 |
| Square | 25310961 |
| Cube | 127339444791 |
| Square root | 70.929543 (= 3√559) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 116 |
| Scientific notation | 5.031 × |
5031 in other forms
| Form | Value |
|---|---|
| In words | five thousand and thirty-one |
| Binary (base 2) | 1001110100111 |
| Octal (base 8) | 11647 |
| Hexadecimal (base 16) | 13A7 |
| Base 3 | 20220100 |
| As time | 5031 seconds = 1 h 23 min 51 s |
Is 5031 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 (5031 ÷ 3 = 1677) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (5031 ÷ 9 = 559) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5031 a prime number?
No. 5031 = × 13 × 43, so it is divisible by 3.
What are the factors of 5031?
1, 3, 9, 13, 39, 43, 117, 129, 387, 559, 1677, 5031.
What is 5031 in binary?
1001110100111 (hexadecimal 13A7, octal 11647).
What is the square root of 5031?
About 70.9295, exactly 3√559.
Is 5031 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 5031?
5031 is a Harshad number: divisible by its digit sum 9.