The number 90951
90951 is a triangular number: 1 + 2 + … + 426 = 90951. Its prime factorisation is 3 × 7 × 61 × 71. Divisors (16): 1, 3, 7, 21, 61, 71, 183, 213, 427, 497, 1281, 1491, 4331, 12993, 30317, 90951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90951: a triangular number: 1 + 2 + … + 426 = 90951; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
90951 is composite. Its prime factorisation is
- 3
The divisors add up to 142848; without 90951 itself that is 51897, so 90951 is deficient (51897 is less than 90951). Euler's totient φ(90951) = 50400 numbers up to 90951 share no factor with it.
- 4
The digits of 90951 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 208 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90951 = 3 \times 7 \times 61 \times 71 \]
90951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 142848 |
| Euler totient φ(n) | 50400 |
| Square | 8272084401 |
| Cube | 752354348355351 |
| Square root | 301.580835 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 208 |
| Scientific notation | 9.0951 × |
90951 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand nine hundred and fifty-one |
| Binary (base 2) | 10110001101000111 |
| Octal (base 8) | 261507 |
| Hexadecimal (base 16) | 16347 |
| Base 3 | 11121202120 |
| As time | 90951 seconds = 25 h 15 min 51 s |
Is 90951 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 (90951 ÷ 3 = 30317) | 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 | Yes (90951 ÷ 7 = 12993) | 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 7) | 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 3) | 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 90951 a prime number?
No. 90951 = 3 × 7 × 61 × 71, so it is divisible by 3.
What are the factors of 90951?
1, 3, 7, 21, 61, 71, 183, 213, 427, 497, 1281, 1491, 4331, 12993, 30317, 90951.
What is 90951 in binary?
10110001101000111 (hexadecimal 16347, octal 261507).
What is the square root of 90951?
About 301.5808.
Is 90951 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 90951?
90951 is a triangular number: 1 + 2 + … + 426 = 90951; a happy number: repeatedly adding the squares of its digits reaches 1.