The number 13251
13251 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 631. Divisors (8): 1, 3, 7, 21, 631, 1893, 4417, 13251.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13251 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13251 is composite. Its prime factorisation is
- 3
The divisors add up to 20224; without 13251 itself that is 6973, so 13251 is deficient (6973 is less than 13251). Euler's totient φ(13251) = 7560 numbers up to 13251 share no factor with it.
- 4
The digits of 13251 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13251 = 3 \times 7 \times 631 \]
13251 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20224 |
| Euler totient φ(n) | 7560 |
| Square | 175589001 |
| Cube | 2326729852251 |
| Square root | 115.112988 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 76 |
| Scientific notation | 1.3251 × |
13251 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand two hundred and fifty-one |
| Binary (base 2) | 11001111000011 |
| Octal (base 8) | 31703 |
| Hexadecimal (base 16) | 33C3 |
| Base 3 | 200011210 |
| As time | 13251 seconds = 3 h 40 min 51 s |
Is 13251 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 | Yes (13251 ÷ 3 = 4417) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (13251 ÷ 7 = 1893) | 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 3) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 13251 a prime number?
No. 13251 = 3 × 7 × 631, so it is divisible by 3.
What are the factors of 13251?
1, 3, 7, 21, 631, 1893, 4417, 13251.
What is 13251 in binary?
11001111000011 (hexadecimal 33C3, octal 31703).
What is the square root of 13251?
About 115.1130.
Is 13251 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 13251?
It is a composite number with 8 divisors.