The number 13051
13051 is a composite number with 4 divisors. Its prime factorisation is 31 × 421. Divisors (4): 1, 31, 421, 13051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 13051: a semiprime: 31 × 421, the product of two primes.
- 2
13051 is composite. Its prime factorisation is
- 3
The divisors add up to 13504; without 13051 itself that is 453, so 13051 is deficient (453 is less than 13051). Euler's totient φ(13051) = 12600 numbers up to 13051 share no factor with it.
- 4
The digits of 13051 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13051 = 31 \times 421 \]
13051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13504 |
| Euler totient φ(n) | 12600 |
| Square | 170328601 |
| Cube | 2222958571651 |
| Square root | 114.240973 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 76 |
| Scientific notation | 1.3051 × |
13051 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand and fifty-one |
| Binary (base 2) | 11001011111011 |
| Octal (base 8) | 31373 |
| Hexadecimal (base 16) | 32FB |
| Base 3 | 122220101 |
| As time | 13051 seconds = 3 h 37 min 31 s |
Is 13051 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13051 a prime number?
No. 13051 = 31 × 421, so it is divisible by 31.
What are the factors of 13051?
1, 31, 421, 13051.
What is 13051 in binary?
11001011111011 (hexadecimal 32FB, octal 31373).
What is the square root of 13051?
About 114.2410.
Is 13051 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 13051?
13051 is a semiprime: 31 × 421, the product of two primes.