The number 46905
46905 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 53 × 59. Divisors (16): 1, 3, 5, 15, 53, 59, 159, 177, 265, 295, 795, 885, 3127, 9381, 15635, 46905.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46905 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46905 is composite. Its prime factorisation is
- 3
The divisors add up to 77760; without 46905 itself that is 30855, so 46905 is deficient (30855 is less than 46905). Euler's totient φ(46905) = 24128 numbers up to 46905 share no factor with it.
- 4
The digits of 46905 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46905 = 3 \times 5 \times 53 \times 59 \]
46905 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 77760 |
| Euler totient φ(n) | 24128 |
| Square | 2200079025 |
| Cube | 103194706667625 |
| Square root | 216.575622 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 88 |
| Scientific notation | 4.6905 × |
46905 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and five |
| Binary (base 2) | 1011011100111001 |
| Octal (base 8) | 133471 |
| Hexadecimal (base 16) | B739 |
| Base 3 | 2101100020 |
| As time | 46905 seconds = 13 h 1 min 45 s |
Is 46905 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 (46905 ÷ 3 = 15635) | 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 | Yes (46905 ÷ 5 = 9381) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 46905 a prime number?
No. 46905 = 3 × 5 × 53 × 59, so it is divisible by 3.
What are the factors of 46905?
1, 3, 5, 15, 53, 59, 159, 177, 265, 295, 795, 885, 3127, 9381, 15635, 46905.
What is 46905 in binary?
1011011100111001 (hexadecimal B739, octal 133471).
What is the square root of 46905?
About 216.5756.
Is 46905 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 46905?
It is a composite number with 16 divisors.