The number 90513
90513 is a composite number with 12 divisors. Its prime factorisation is × 89 × 113. Divisors (12): 1, 3, 9, 89, 113, 267, 339, 801, 1017, 10057, 30171, 90513.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
90513 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
90513 is composite. Its prime factorisation is
- 3
The divisors add up to 133380; without 90513 itself that is 42867, so 90513 is deficient (42867 is less than 90513). Euler's totient φ(90513) = 59136 numbers up to 90513 share no factor with it.
- 4
The digits of 90513 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90513 = 3^{2} \times 89 \times 113 \]90513 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 133380 |
| Euler totient φ(n) | 59136 |
| Square | 8192603169 |
| Cube | 741537090635697 |
| Square root | 300.853785 (= 3√10057) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.0513 × |
90513 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand five hundred and thirteen |
| Binary (base 2) | 10110000110010001 |
| Octal (base 8) | 260621 |
| Hexadecimal (base 16) | 16191 |
| Base 3 | 11121011100 |
| As time | 90513 seconds = 25 h 8 min 33 s |
Is 90513 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 (90513 ÷ 3 = 30171) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (90513 ÷ 9 = 10057) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90513 a prime number?
No. 90513 = × 89 × 113, so it is divisible by 3.
What are the factors of 90513?
1, 3, 9, 89, 113, 267, 339, 801, 1017, 10057, 30171, 90513.
What is 90513 in binary?
10110000110010001 (hexadecimal 16191, octal 260621).
What is the square root of 90513?
About 300.8538, exactly 3√10057.
Is 90513 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 90513?
It is a composite number with 12 divisors.