The number 5146
5146 is a composite number with 8 divisors. Its prime factorisation is 2 × 31 × 83. Divisors (8): 1, 2, 31, 62, 83, 166, 2573, 5146.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5146 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5146 is composite. Its prime factorisation is
- 3
The divisors add up to 8064; without 5146 itself that is 2918, so 5146 is deficient (2918 is less than 5146). Euler's totient φ(5146) = 2460 numbers up to 5146 share no factor with it.
- 4
The digits of 5146 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 28 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5146 = 2 \times 31 \times 83 \]
5146 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 8064 |
| Euler totient φ(n) | 2460 |
| Square | 26481316 |
| Cube | 136272852136 |
| Square root | 71.735626 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 28 |
| Scientific notation | 5.146 × |
5146 in other forms
| Form | Value |
|---|---|
| In words | five thousand one hundred and forty-six |
| Binary (base 2) | 1010000011010 |
| Octal (base 8) | 12032 |
| Hexadecimal (base 16) | 141A |
| Base 3 | 21001121 |
| As time | 5146 seconds = 1 h 25 min 46 s |
Is 5146 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5146 ÷ 2 = 2573) | 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 2) | 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 4) | 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 2) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5146 a prime number?
No. 5146 = 2 × 31 × 83, so it is divisible by 2.
What are the factors of 5146?
1, 2, 31, 62, 83, 166, 2573, 5146.
What is 5146 in binary?
1010000011010 (hexadecimal 141A, octal 12032).
What is the square root of 5146?
About 71.7356.
Is 5146 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 5146?
It is a composite number with 8 divisors.