The number 46231
46231 is a composite number with 4 divisors. Its prime factorisation is 83 × 557. Divisors (4): 1, 83, 557, 46231.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46231: a semiprime: 83 × 557, the product of two primes.
- 2
46231 is composite. Its prime factorisation is
- 3
The divisors add up to 46872; without 46231 itself that is 641, so 46231 is deficient (641 is less than 46231). Euler's totient φ(46231) = 45592 numbers up to 46231 share no factor with it.
- 4
The digits of 46231 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46231 = 83 \times 557 \]
46231 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 46872 |
| Euler totient φ(n) | 45592 |
| Square | 2137305361 |
| Cube | 98809764144391 |
| Square root | 215.013953 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6231 × |
46231 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand two hundred and thirty-one |
| Binary (base 2) | 1011010010010111 |
| Octal (base 8) | 132227 |
| Hexadecimal (base 16) | B497 |
| Base 3 | 2100102021 |
| As time | 46231 seconds = 12 h 50 min 31 s |
Is 46231 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46231 a prime number?
No. 46231 = 83 × 557, so it is divisible by 83.
What are the factors of 46231?
1, 83, 557, 46231.
What is 46231 in binary?
1011010010010111 (hexadecimal B497, octal 132227).
What is the square root of 46231?
About 215.0140.
Is 46231 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 46231?
46231 is a semiprime: 83 × 557, the product of two primes.