The number 46502
46502 is a composite number with 4 divisors. Its prime factorisation is 2 × 23251. Divisors (4): 1, 2, 23251, 46502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46502: a semiprime: 2 × 23251, the product of two primes.
- 2
46502 is composite. Its prime factorisation is
- 3
The divisors add up to 69756; without 46502 itself that is 23254, so 46502 is deficient (23254 is less than 46502). Euler's totient φ(46502) = 23250 numbers up to 46502 share no factor with it.
- 4
The digits of 46502 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 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46502 = 2 \times 23251 \]
46502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 69756 |
| Euler totient φ(n) | 23250 |
| Square | 2162436004 |
| Cube | 100557599058008 |
| Square root | 215.643224 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.6502 × |
46502 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and two |
| Binary (base 2) | 1011010110100110 |
| Octal (base 8) | 132646 |
| Hexadecimal (base 16) | B5A6 |
| Base 3 | 2100210022 |
| As time | 46502 seconds = 12 h 55 min 2 s |
Is 46502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46502 ÷ 2 = 23251) | 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 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 6) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 46502 a prime number?
No. 46502 = 2 × 23251, so it is divisible by 2.
What are the factors of 46502?
1, 2, 23251, 46502.
What is 46502 in binary?
1011010110100110 (hexadecimal B5A6, octal 132646).
What is the square root of 46502?
About 215.6432.
Is 46502 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 46502?
46502 is a semiprime: 2 × 23251, the product of two primes.