The number 90671
90671 is a composite number with 4 divisors. Its prime factorisation is 7 × 12953. Divisors (4): 1, 7, 12953, 90671.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 90671: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 12953, the product of two primes.
- 2
90671 is composite. Its prime factorisation is
- 3
The divisors add up to 103632; without 90671 itself that is 12961, so 90671 is deficient (12961 is less than 90671). Euler's totient φ(90671) = 77712 numbers up to 90671 share no factor with it.
- 4
The digits of 90671 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 90671 = 7 \times 12953 \]
90671 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 103632 |
| Euler totient φ(n) | 77712 |
| Square | 8221230241 |
| Cube | 745427167181711 |
| Square root | 301.116257 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.0671 × |
90671 in other forms
| Form | Value |
|---|---|
| In words | ninety thousand six hundred and seventy-one |
| Binary (base 2) | 10110001000101111 |
| Octal (base 8) | 261057 |
| Hexadecimal (base 16) | 1622F |
| Base 3 | 11121101012 |
| As time | 90671 seconds = 25 h 11 min 11 s |
Is 90671 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 | No (remainder 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (90671 ÷ 7 = 12953) | 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 5) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 90671 a prime number?
No. 90671 = 7 × 12953, so it is divisible by 7.
What are the factors of 90671?
1, 7, 12953, 90671.
What is 90671 in binary?
10110001000101111 (hexadecimal 1622F, octal 261057).
What is the square root of 90671?
About 301.1163.
Is 90671 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 90671?
90671 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 12953, the product of two primes.