The number 46213
46213 is a composite number with 4 divisors. Its prime factorisation is 37 × 1249. Divisors (4): 1, 37, 1249, 46213.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46213: a semiprime: 37 × 1249, the product of two primes.
- 2
46213 is composite. Its prime factorisation is
- 3
The divisors add up to 47500; without 46213 itself that is 1287, so 46213 is deficient (1287 is less than 46213). Euler's totient φ(46213) = 44928 numbers up to 46213 share no factor with it.
- 4
The digits of 46213 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
\[ 46213 = 37 \times 1249 \]
46213 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 47500 |
| Euler totient φ(n) | 44928 |
| Square | 2135641369 |
| Cube | 98694394585597 |
| Square root | 214.972091 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6213 × |
46213 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand two hundred and thirteen |
| Binary (base 2) | 1011010010000101 |
| Octal (base 8) | 132205 |
| Hexadecimal (base 16) | B485 |
| Base 3 | 2100101121 |
| As time | 46213 seconds = 12 h 50 min 13 s |
Is 46213 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 3) | 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 6) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 46213 a prime number?
No. 46213 = 37 × 1249, so it is divisible by 37.
What are the factors of 46213?
1, 37, 1249, 46213.
What is 46213 in binary?
1011010010000101 (hexadecimal B485, octal 132205).
What is the square root of 46213?
About 214.9721.
Is 46213 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 46213?
46213 is a semiprime: 37 × 1249, the product of two primes.