The number 46909
46909 is a composite number with 4 divisors. Its prime factorisation is 61 × 769. Divisors (4): 1, 61, 769, 46909.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46909: a semiprime: 61 × 769, the product of two primes.
- 2
46909 is composite. Its prime factorisation is
- 3
The divisors add up to 47740; without 46909 itself that is 831, so 46909 is deficient (831 is less than 46909). Euler's totient φ(46909) = 46080 numbers up to 46909 share no factor with it.
- 4
The digits of 46909 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 132 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46909 = 61 \times 769 \]
46909 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 47740 |
| Euler totient φ(n) | 46080 |
| Square | 2200454281 |
| Cube | 103221109867429 |
| Square root | 216.584856 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 132 |
| Scientific notation | 4.6909 × |
46909 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and nine |
| Binary (base 2) | 1011011100111101 |
| Octal (base 8) | 133475 |
| Hexadecimal (base 16) | B73D |
| Base 3 | 2101100101 |
| As time | 46909 seconds = 13 h 1 min 49 s |
Is 46909 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 4) | 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 | No (remainder 2) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46909 a prime number?
No. 46909 = 61 × 769, so it is divisible by 61.
What are the factors of 46909?
1, 61, 769, 46909.
What is 46909 in binary?
1011011100111101 (hexadecimal B73D, octal 133475).
What is the square root of 46909?
About 216.5849.
Is 46909 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 46909?
46909 is a semiprime: 61 × 769, the product of two primes.