The number 46262
46262 is a composite number with 4 divisors. Its prime factorisation is 2 × 23131. Divisors (4): 1, 2, 23131, 46262.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46262: a semiprime: 2 × 23131, the product of two primes.
- 2
46262 is composite. Its prime factorisation is
- 3
The divisors add up to 69396; without 46262 itself that is 23134, so 46262 is deficient (23134 is less than 46262). Euler's totient φ(46262) = 23130 numbers up to 46262 share no factor with it.
- 4
The digits of 46262 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 163 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46262 = 2 \times 23131 \]
46262 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 69396 |
| Euler totient φ(n) | 23130 |
| Square | 2140172644 |
| Cube | 99008666856728 |
| Square root | 215.086029 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 163 |
| Scientific notation | 4.6262 × |
46262 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand two hundred and sixty-two |
| Binary (base 2) | 1011010010110110 |
| Octal (base 8) | 132266 |
| Hexadecimal (base 16) | B4B6 |
| Base 3 | 2100110102 |
| As time | 46262 seconds = 12 h 51 min 2 s |
Is 46262 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46262 ÷ 2 = 23131) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46262 a prime number?
No. 46262 = 2 × 23131, so it is divisible by 2.
What are the factors of 46262?
1, 2, 23131, 46262.
What is 46262 in binary?
1011010010110110 (hexadecimal B4B6, octal 132266).
What is the square root of 46262?
About 215.0860.
Is 46262 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 46262?
46262 is a semiprime: 2 × 23131, the product of two primes.