The number 90748
90748 is a composite number with 18 divisors. Its prime factorisation is × × 463. Divisors (18): 1, 2, 4, 7, 14, 28, 49, 98, 196, 463, 926, 1852, 3241, 6482, 12964, 22687 … 90748.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90748: a Harshad number: divisible by its digit sum 28.
- 2
90748 is composite. Its prime factorisation is
- 3
The divisors add up to 185136; without 90748 itself that is 94388, so 90748 is abundant (94388 is more than 90748). Euler's totient φ(90748) = 38808 numbers up to 90748 share no factor with it.
- 4
The digits of 90748 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90748 = 2^{2} \times 7^{2} \times 463 \]90748 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 185136 |
| Euler totient φ(n) | 38808 |
| Square | 8235199504 |
| Cube | 747327884588992 |
| Square root | 301.244087 (= 14√463) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.0748 × |
90748 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand seven hundred and forty-eight |
| Binary (base 2) | 10110001001111100 |
| Octal (base 8) | 261174 |
| Hexadecimal (base 16) | 1627C |
| Base 3 | 11121111001 |
| As time | 90748 seconds = 25 h 12 min 28 s |
Is 90748 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90748 ÷ 2 = 45374) | 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 (90748 ÷ 4 = 22687) | 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 | Yes (90748 ÷ 7 = 12964) | 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 1) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90748 a prime number?
No. 90748 = × × 463, so it is divisible by 2.
What are the factors of 90748?
1, 2, 4, 7, 14, 28, 49, 98, 196, 463, 926, 1852, 3241, 6482, 12964, 22687, 45374, 90748.
What is 90748 in binary?
10110001001111100 (hexadecimal 1627C, octal 261174).
What is the square root of 90748?
About 301.2441, exactly 14√463.
Is 90748 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 90748?
90748 is a Harshad number: divisible by its digit sum 28.