The number 90946
90946 is a composite number with 8 divisors. Its prime factorisation is 2 × 37 × 1229. Divisors (8): 1, 2, 37, 74, 1229, 2458, 45473, 90946.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90946 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90946 is composite. Its prime factorisation is
- 3
The divisors add up to 140220; without 90946 itself that is 49274, so 90946 is deficient (49274 is less than 90946). Euler's totient φ(90946) = 44208 numbers up to 90946 share no factor with it.
- 4
The digits of 90946 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 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90946 = 2 \times 37 \times 1229 \]
90946 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 140220 |
| Euler totient φ(n) | 44208 |
| Square | 8271174916 |
| Cube | 752230273910536 |
| Square root | 301.572545 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.0946 × |
90946 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand nine hundred and forty-six |
| Binary (base 2) | 10110001101000010 |
| Octal (base 8) | 261502 |
| Hexadecimal (base 16) | 16342 |
| Base 3 | 11121202101 |
| As time | 90946 seconds = 25 h 15 min 46 s |
Is 90946 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (90946 ÷ 2 = 45473) | 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 1) | 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 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 2) | 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 6) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90946 a prime number?
No. 90946 = 2 × 37 × 1229, so it is divisible by 2.
What are the factors of 90946?
1, 2, 37, 74, 1229, 2458, 45473, 90946.
What is 90946 in binary?
10110001101000010 (hexadecimal 16342, octal 261502).
What is the square root of 90946?
About 301.5725.
Is 90946 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 90946?
It is a composite number with 8 divisors.