The number 31141
31141 is a composite number with 8 divisors. Its prime factorisation is 11 × 19 × 149. Divisors (8): 1, 11, 19, 149, 209, 1639, 2831, 31141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 31141: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
31141 is composite. Its prime factorisation is
- 3
The divisors add up to 36000; without 31141 itself that is 4859, so 31141 is deficient (4859 is less than 31141). Euler's totient φ(31141) = 26640 numbers up to 31141 share no factor with it.
- 4
The digits of 31141 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 222 steps to reach 1.
LaTeX source of the formulas on this page
\[ 31141 = 11 \times 19 \times 149 \]
31141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 36000 |
| Euler totient φ(n) | 26640 |
| Square | 969761881 |
| Cube | 30199354736221 |
| Square root | 176.468127 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 222 |
| Scientific notation | 3.1141 × |
31141 in other forms
| Form | Value |
|---|---|
| In words | thirty-one thousand one hundred and forty-one |
| Binary (base 2) | 111100110100101 |
| Octal (base 8) | 74645 |
| Hexadecimal (base 16) | 79A5 |
| Base 3 | 1120201101 |
| As time | 31141 seconds = 8 h 39 min 1 s |
Is 31141 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 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 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (31141 ÷ 11 = 2831) | 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 31141 a prime number?
No. 31141 = 11 × 19 × 149, so it is divisible by 11.
What are the factors of 31141?
1, 11, 19, 149, 209, 1639, 2831, 31141.
What is 31141 in binary?
111100110100101 (hexadecimal 79A5, octal 74645).
What is the square root of 31141?
About 176.4681.
Is 31141 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 31141?
31141 is a happy number: repeatedly adding the squares of its digits reaches 1.