The number 51013
51013 is a composite number with 4 divisors. Its prime factorisation is 139 × 367. Divisors (4): 1, 139, 367, 51013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51013: a semiprime: 139 × 367, the product of two primes.
- 2
51013 is composite. Its prime factorisation is
- 3
The divisors add up to 51520; without 51013 itself that is 507, so 51013 is deficient (507 is less than 51013). Euler's totient φ(51013) = 50508 numbers up to 51013 share no factor with it.
- 4
The digits of 51013 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51013 = 139 \times 367 \]
51013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51520 |
| Euler totient φ(n) | 50508 |
| Square | 2602326169 |
| Cube | 132752464859197 |
| Square root | 225.860576 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1013 × |
51013 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and thirteen |
| Binary (base 2) | 1100011101000101 |
| Octal (base 8) | 143505 |
| Hexadecimal (base 16) | C745 |
| Base 3 | 2120222101 |
| As time | 51013 seconds = 14 h 10 min 13 s |
Is 51013 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 3) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 51013 a prime number?
No. 51013 = 139 × 367, so it is divisible by 139.
What are the factors of 51013?
1, 139, 367, 51013.
What is 51013 in binary?
1100011101000101 (hexadecimal C745, octal 143505).
What is the square root of 51013?
About 225.8606.
Is 51013 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 51013?
51013 is a semiprime: 139 × 367, the product of two primes.