The number 61131
61131 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 41 × 71. Divisors (16): 1, 3, 7, 21, 41, 71, 123, 213, 287, 497, 861, 1491, 2911, 8733, 20377, 61131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
61131 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
61131 is composite. Its prime factorisation is
- 3
The divisors add up to 96768; without 61131 itself that is 35637, so 61131 is deficient (35637 is less than 61131). Euler's totient φ(61131) = 33600 numbers up to 61131 share no factor with it.
- 4
The digits of 61131 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 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 61131 = 3 \times 7 \times 41 \times 71 \]
61131 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 96768 |
| Euler totient φ(n) | 33600 |
| Square | 3736999161 |
| Cube | 228446495711091 |
| Square root | 247.246840 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.1131 × |
61131 in other forms
| Form | Value |
|---|---|
| In words | sixty-one thousand one hundred and thirty-one |
| Binary (base 2) | 1110111011001011 |
| Octal (base 8) | 167313 |
| Hexadecimal (base 16) | EECB |
| Base 3 | 10002212010 |
| As time | 61131 seconds = 16 h 58 min 51 s |
Is 61131 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 (61131 ÷ 3 = 20377) | 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 (61131 ÷ 7 = 8733) | 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 4) | 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 61131 a prime number?
No. 61131 = 3 × 7 × 41 × 71, so it is divisible by 3.
What are the factors of 61131?
1, 3, 7, 21, 41, 71, 123, 213, 287, 497, 861, 1491, 2911, 8733, 20377, 61131.
What is 61131 in binary?
1110111011001011 (hexadecimal EECB, octal 167313).
What is the square root of 61131?
About 247.2468.
Is 61131 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 61131?
It is a composite number with 16 divisors.