The number 46501
46501 is a composite number with 12 divisors. Its prime factorisation is × 13 × 73. Divisors (12): 1, 7, 13, 49, 73, 91, 511, 637, 949, 3577, 6643, 46501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46501 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46501 is composite. Its prime factorisation is
- 3
The divisors add up to 59052; without 46501 itself that is 12551, so 46501 is deficient (12551 is less than 46501). Euler's totient φ(46501) = 36288 numbers up to 46501 share no factor with it.
- 4
The digits of 46501 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 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46501 = 7^{2} \times 13 \times 73 \]46501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 59052 |
| Euler totient φ(n) | 36288 |
| Square | 2162343001 |
| Cube | 100551111889501 |
| Square root | 215.640905 (= 7√949) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.6501 × |
46501 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and one |
| Binary (base 2) | 1011010110100101 |
| Octal (base 8) | 132645 |
| Hexadecimal (base 16) | B5A5 |
| Base 3 | 2100210021 |
| As time | 46501 seconds = 12 h 55 min 1 s |
Is 46501 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 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 | Yes (46501 ÷ 7 = 6643) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 46501 a prime number?
No. 46501 = × 13 × 73, so it is divisible by 7.
What are the factors of 46501?
1, 7, 13, 49, 73, 91, 511, 637, 949, 3577, 6643, 46501.
What is 46501 in binary?
1011010110100101 (hexadecimal B5A5, octal 132645).
What is the square root of 46501?
About 215.6409, exactly 7√949.
Is 46501 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 46501?
It is a composite number with 12 divisors.