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