The number 46948
46948 is a composite number with 18 divisors. Its prime factorisation is × × 97. Divisors (18): 1, 2, 4, 11, 22, 44, 97, 121, 194, 242, 388, 484, 1067, 2134, 4268, 11737 … 46948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46948 is composite. Its prime factorisation is
- 3
The divisors add up to 91238; without 46948 itself that is 44290, so 46948 is deficient (44290 is less than 46948). Euler's totient φ(46948) = 21120 numbers up to 46948 share no factor with it.
- 4
The digits of 46948 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46948 = 2^{2} \times 11^{2} \times 97 \]46948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 91238 |
| Euler totient φ(n) | 21120 |
| Square | 2204114704 |
| Cube | 103478777123392 |
| Square root | 216.674872 (= 22√97) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6948 × |
46948 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand nine hundred and forty-eight |
| Binary (base 2) | 1011011101100100 |
| Octal (base 8) | 133544 |
| Hexadecimal (base 16) | B764 |
| Base 3 | 2101101211 |
| As time | 46948 seconds = 13 h 2 min 28 s |
Is 46948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46948 ÷ 2 = 23474) | 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 | Yes (46948 ÷ 4 = 11737) | 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 6) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | Yes (46948 ÷ 11 = 4268) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46948 a prime number?
No. 46948 = × × 97, so it is divisible by 2.
What are the factors of 46948?
1, 2, 4, 11, 22, 44, 97, 121, 194, 242, 388, 484, 1067, 2134, 4268, 11737, 23474, 46948.
What is 46948 in binary?
1011011101100100 (hexadecimal B764, octal 133544).
What is the square root of 46948?
About 216.6749, exactly 22√97.
Is 46948 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 46948?
It is a composite number with 18 divisors.