The number 46978
46978 is a composite number with 8 divisors. Its prime factorisation is 2 × 83 × 283. Divisors (8): 1, 2, 83, 166, 283, 566, 23489, 46978.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46978 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46978 is composite. Its prime factorisation is
- 3
The divisors add up to 71568; without 46978 itself that is 24590, so 46978 is deficient (24590 is less than 46978). Euler's totient φ(46978) = 23124 numbers up to 46978 share no factor with it.
- 4
The digits of 46978 add up to 34, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46978 = 2 \times 83 \times 283 \]
46978 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 71568 |
| Euler totient φ(n) | 23124 |
| Square | 2206932484 |
| Cube | 103677274233352 |
| Square root | 216.744089 |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.6978 × |
46978 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and seventy-eight |
| Binary (base 2) | 1011011110000010 |
| Octal (base 8) | 133602 |
| Hexadecimal (base 16) | B782 |
| Base 3 | 2101102221 |
| As time | 46978 seconds = 13 h 2 min 58 s |
Is 46978 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46978 ÷ 2 = 23489) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46978 a prime number?
No. 46978 = 2 × 83 × 283, so it is divisible by 2.
What are the factors of 46978?
1, 2, 83, 166, 283, 566, 23489, 46978.
What is 46978 in binary?
1011011110000010 (hexadecimal B782, octal 133602).
What is the square root of 46978?
About 216.7441.
Is 46978 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 46978?
It is a composite number with 8 divisors.