The number 46131
46131 is a composite number with 4 divisors. Its prime factorisation is 3 × 15377. Divisors (4): 1, 3, 15377, 46131.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46131: a semiprime: 3 × 15377, the product of two primes.
- 2
46131 is composite. Its prime factorisation is
- 3
The divisors add up to 61512; without 46131 itself that is 15381, so 46131 is deficient (15381 is less than 46131). Euler's totient φ(46131) = 30752 numbers up to 46131 share no factor with it.
- 4
The digits of 46131 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46131 = 3 \times 15377 \]
46131 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 61512 |
| Euler totient φ(n) | 30752 |
| Square | 2128069161 |
| Cube | 98169958466091 |
| Square root | 214.781284 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 57 |
| Scientific notation | 4.6131 × |
46131 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand one hundred and thirty-one |
| Binary (base 2) | 1011010000110011 |
| Octal (base 8) | 132063 |
| Hexadecimal (base 16) | B433 |
| Base 3 | 2100021120 |
| As time | 46131 seconds = 12 h 48 min 51 s |
Is 46131 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 (46131 ÷ 3 = 15377) | 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 | No (remainder 1) | 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 6) | 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 8) | 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 46131 a prime number?
No. 46131 = 3 × 15377, so it is divisible by 3.
What are the factors of 46131?
1, 3, 15377, 46131.
What is 46131 in binary?
1011010000110011 (hexadecimal B433, octal 132063).
What is the square root of 46131?
About 214.7813.
Is 46131 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 46131?
46131 is a semiprime: 3 × 15377, the product of two primes.