The number 5161
5161 is a composite number with 4 divisors. Its prime factorisation is 13 × 397. Divisors (4): 1, 13, 397, 5161.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5161: a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 397, the product of two primes.
- 2
5161 is composite. Its prime factorisation is
- 3
The divisors add up to 5572; without 5161 itself that is 411, so 5161 is deficient (411 is less than 5161). Euler's totient φ(5161) = 4752 numbers up to 5161 share no factor with it.
- 4
The digits of 5161 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 116 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5161 = 13 \times 397 \]
5161 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5572 |
| Euler totient φ(n) | 4752 |
| Square | 26635921 |
| Cube | 137467988281 |
| Square root | 71.840100 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 116 |
| Scientific notation | 5.161 × |
5161 in other forms
| Form | Value |
|---|---|
| In words | five thousand one hundred and sixty-one |
| Binary (base 2) | 1010000101001 |
| Octal (base 8) | 12051 |
| Hexadecimal (base 16) | 1429 |
| Base 3 | 21002011 |
| As time | 5161 seconds = 1 h 26 min 1 s |
Is 5161 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 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 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 1) | 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 2) | 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 5161 a prime number?
No. 5161 = 13 × 397, so it is divisible by 13.
What are the factors of 5161?
1, 13, 397, 5161.
What is 5161 in binary?
1010000101001 (hexadecimal 1429, octal 12051).
What is the square root of 5161?
About 71.8401.
Is 5161 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 5161?
5161 is a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 397, the product of two primes.