The number 31252
31252 is a composite number with 12 divisors. Its prime factorisation is × 13 × 601. Divisors (12): 1, 2, 4, 13, 26, 52, 601, 1202, 2404, 7813, 15626, 31252.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 31252: a Harshad number: divisible by its digit sum 13.
- 2
31252 is composite. Its prime factorisation is
- 3
The divisors add up to 58996; without 31252 itself that is 27744, so 31252 is deficient (27744 is less than 31252). Euler's totient φ(31252) = 14400 numbers up to 31252 share no factor with it.
- 4
The digits of 31252 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 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 31252 = 2^{2} \times 13 \times 601 \]31252 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 58996 |
| Euler totient φ(n) | 14400 |
| Square | 976687504 |
| Cube | 30523437875008 |
| Square root | 176.782352 (= 2√7813) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 41 |
| Scientific notation | 3.1252 × |
31252 in other forms
| Form | Value |
|---|---|
| In words | thirty-one thousand two hundred and fifty-two |
| Binary (base 2) | 111101000010100 |
| Octal (base 8) | 75024 |
| Hexadecimal (base 16) | 7A14 |
| Base 3 | 1120212111 |
| As time | 31252 seconds = 8 h 40 min 52 s |
Is 31252 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (31252 ÷ 2 = 15626) | 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 | Yes (31252 ÷ 4 = 7813) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | 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 2) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 31252 a prime number?
No. 31252 = × 13 × 601, so it is divisible by 2.
What are the factors of 31252?
1, 2, 4, 13, 26, 52, 601, 1202, 2404, 7813, 15626, 31252.
What is 31252 in binary?
111101000010100 (hexadecimal 7A14, octal 75024).
What is the square root of 31252?
About 176.7824, exactly 2√7813.
Is 31252 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 31252?
31252 is a Harshad number: divisible by its digit sum 13.