The number 46929
46929 is a composite number with 4 divisors. Its prime factorisation is 3 × 15643. Divisors (4): 1, 3, 15643, 46929.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46929: a semiprime: 3 × 15643, the product of two primes.
- 2
46929 is composite. Its prime factorisation is
- 3
The divisors add up to 62576; without 46929 itself that is 15647, so 46929 is deficient (15647 is less than 46929). Euler's totient φ(46929) = 31284 numbers up to 46929 share no factor with it.
- 4
The digits of 46929 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 106 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46929 = 3 \times 15643 \]
46929 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 62576 |
| Euler totient φ(n) | 31284 |
| Square | 2202331041 |
| Cube | 103353193423089 |
| Square root | 216.631023 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 106 |
| Scientific notation | 4.6929 × |
46929 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and twenty-nine |
| Binary (base 2) | 1011011101010001 |
| Octal (base 8) | 133521 |
| Hexadecimal (base 16) | B751 |
| Base 3 | 2101101010 |
| As time | 46929 seconds = 13 h 2 min 9 s |
Is 46929 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 (46929 ÷ 3 = 15643) | 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 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 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 46929 a prime number?
No. 46929 = 3 × 15643, so it is divisible by 3.
What are the factors of 46929?
1, 3, 15643, 46929.
What is 46929 in binary?
1011011101010001 (hexadecimal B751, octal 133521).
What is the square root of 46929?
About 216.6310.
Is 46929 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 46929?
46929 is a semiprime: 3 × 15643, the product of two primes.