The number 5149
5149 is a composite number with 4 divisors. Its prime factorisation is 19 × 271. Divisors (4): 1, 19, 271, 5149.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5149: a Harshad number: divisible by its digit sum 19; a semiprime: 19 × 271, the product of two primes.
- 2
5149 is composite. Its prime factorisation is
- 3
The divisors add up to 5440; without 5149 itself that is 291, so 5149 is deficient (291 is less than 5149). Euler's totient φ(5149) = 4860 numbers up to 5149 share no factor with it.
- 4
The digits of 5149 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 147 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5149 = 19 \times 271 \]
5149 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 5440 |
| Euler totient φ(n) | 4860 |
| Square | 26512201 |
| Cube | 136511322949 |
| Square root | 71.756533 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 147 |
| Scientific notation | 5.149 × |
5149 in other forms
| Form | Value |
|---|---|
| In words | five thousand one hundred and forty-nine |
| Binary (base 2) | 1010000011101 |
| Octal (base 8) | 12035 |
| Hexadecimal (base 16) | 141D |
| Base 3 | 21001201 |
| As time | 5149 seconds = 1 h 25 min 49 s |
Is 5149 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 4) | 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 4) | 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 5) | 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 9) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5149 a prime number?
No. 5149 = 19 × 271, so it is divisible by 19.
What are the factors of 5149?
1, 19, 271, 5149.
What is 5149 in binary?
1010000011101 (hexadecimal 141D, octal 12035).
What is the square root of 5149?
About 71.7565.
Is 5149 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 5149?
5149 is a Harshad number: divisible by its digit sum 19; a semiprime: 19 × 271, the product of two primes.