The number 46401
46401 is a composite number with 4 divisors. Its prime factorisation is 3 × 15467. Divisors (4): 1, 3, 15467, 46401.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46401: a semiprime: 3 × 15467, the product of two primes.
- 2
46401 is composite. Its prime factorisation is
- 3
The divisors add up to 61872; without 46401 itself that is 15471, so 46401 is deficient (15471 is less than 46401). Euler's totient φ(46401) = 30932 numbers up to 46401 share no factor with it.
- 4
The digits of 46401 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46401 = 3 \times 15467 \]
46401 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 61872 |
| Euler totient φ(n) | 30932 |
| Square | 2153052801 |
| Cube | 99903803019201 |
| Square root | 215.408913 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6401 × |
46401 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand four hundred and one |
| Binary (base 2) | 1011010101000001 |
| Octal (base 8) | 132501 |
| Hexadecimal (base 16) | B541 |
| Base 3 | 2100122120 |
| As time | 46401 seconds = 12 h 53 min 21 s |
Is 46401 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 | Yes (46401 ÷ 3 = 15467) | 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 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46401 a prime number?
No. 46401 = 3 × 15467, so it is divisible by 3.
What are the factors of 46401?
1, 3, 15467, 46401.
What is 46401 in binary?
1011010101000001 (hexadecimal B541, octal 132501).
What is the square root of 46401?
About 215.4089.
Is 46401 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 46401?
46401 is a semiprime: 3 × 15467, the product of two primes.