The number 46748
46748 is a composite number with 24 divisors. Its prime factorisation is × 13 × 29 × 31. Divisors (24): 1, 2, 4, 13, 26, 29, 31, 52, 58, 62, 116, 124, 377, 403, 754, 806 … 46748.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46748: a Harshad number: divisible by its digit sum 29.
- 2
46748 is composite. Its prime factorisation is
- 3
The divisors add up to 94080; without 46748 itself that is 47332, so 46748 is abundant (47332 is more than 46748). Euler's totient φ(46748) = 20160 numbers up to 46748 share no factor with it.
- 4
The digits of 46748 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46748 = 2^{2} \times 13 \times 29 \times 31 \]46748 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 94080 |
| Euler totient φ(n) | 20160 |
| Square | 2185375504 |
| Cube | 102161934060992 |
| Square root | 216.212858 (= 2√11687) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.6748 × |
46748 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand seven hundred and forty-eight |
| Binary (base 2) | 1011011010011100 |
| Octal (base 8) | 133234 |
| Hexadecimal (base 16) | B69C |
| Base 3 | 2101010102 |
| As time | 46748 seconds = 12 h 59 min 8 s |
Is 46748 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46748 ÷ 2 = 23374) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (46748 ÷ 4 = 11687) | 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 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46748 a prime number?
No. 46748 = × 13 × 29 × 31, so it is divisible by 2.
What are the factors of 46748?
1, 2, 4, 13, 26, 29, 31, 52, 58, 62, 116, 124, 377, 403, 754, 806, 899, 1508, 1612, 1798, 3596, 11687, 23374, 46748.
What is 46748 in binary?
1011011010011100 (hexadecimal B69C, octal 133234).
What is the square root of 46748?
About 216.2129, exactly 2√11687.
Is 46748 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 46748?
46748 is a Harshad number: divisible by its digit sum 29.