The number 46947
46947 is a composite number with 4 divisors. Its prime factorisation is 3 × 15649. Divisors (4): 1, 3, 15649, 46947.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46947: a semiprime: 3 × 15649, the product of two primes.
- 2
46947 is composite. Its prime factorisation is
- 3
The divisors add up to 62600; without 46947 itself that is 15653, so 46947 is deficient (15653 is less than 46947). Euler's totient φ(46947) = 31296 numbers up to 46947 share no factor with it.
- 4
The digits of 46947 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46947 = 3 \times 15649 \]
46947 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 62600 |
| Euler totient φ(n) | 31296 |
| Square | 2204020809 |
| Cube | 103472164920123 |
| Square root | 216.672564 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6947 × |
46947 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and forty-seven |
| Binary (base 2) | 1011011101100011 |
| Octal (base 8) | 133543 |
| Hexadecimal (base 16) | B763 |
| Base 3 | 2101101210 |
| As time | 46947 seconds = 13 h 2 min 27 s |
Is 46947 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 (46947 ÷ 3 = 15649) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46947 a prime number?
No. 46947 = 3 × 15649, so it is divisible by 3.
What are the factors of 46947?
1, 3, 15649, 46947.
What is 46947 in binary?
1011011101100011 (hexadecimal B763, octal 133543).
What is the square root of 46947?
About 216.6726.
Is 46947 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 46947?
46947 is a semiprime: 3 × 15649, the product of two primes.