The number 90051
90051 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 2309. Divisors (8): 1, 3, 13, 39, 2309, 6927, 30017, 90051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90051 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90051 is composite. Its prime factorisation is
- 3
The divisors add up to 129360; without 90051 itself that is 39309, so 90051 is deficient (39309 is less than 90051). Euler's totient φ(90051) = 55392 numbers up to 90051 share no factor with it.
- 4
The digits of 90051 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 195 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90051 = 3 \times 13 \times 2309 \]
90051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 129360 |
| Euler totient φ(n) | 55392 |
| Square | 8109182601 |
| Cube | 730240002402651 |
| Square root | 300.084988 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 195 |
| Scientific notation | 9.0051 × |
90051 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand and fifty-one |
| Binary (base 2) | 10101111111000011 |
| Octal (base 8) | 257703 |
| Hexadecimal (base 16) | 15FC3 |
| Base 3 | 11120112020 |
| As time | 90051 seconds = 25 h 0 min 51 s |
Is 90051 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (90051 ÷ 3 = 30017) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90051 a prime number?
No. 90051 = 3 × 13 × 2309, so it is divisible by 3.
What are the factors of 90051?
1, 3, 13, 39, 2309, 6927, 30017, 90051.
What is 90051 in binary?
10101111111000011 (hexadecimal 15FC3, octal 257703).
What is the square root of 90051?
About 300.0850.
Is 90051 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 90051?
It is a composite number with 8 divisors.