The number 92476
92476 is a composite number with 12 divisors. Its prime factorisation is × 61 × 379. Divisors (12): 1, 2, 4, 61, 122, 244, 379, 758, 1516, 23119, 46238, 92476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
92476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
92476 is composite. Its prime factorisation is
- 3
The divisors add up to 164920; without 92476 itself that is 72444, so 92476 is deficient (72444 is less than 92476). Euler's totient φ(92476) = 45360 numbers up to 92476 share no factor with it.
- 4
The digits of 92476 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 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 92476 = 2^{2} \times 61 \times 379 \]92476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 164920 |
| Euler totient φ(n) | 45360 |
| Square | 8551810576 |
| Cube | 790837234826176 |
| Square root | 304.098668 (= 2√23119) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 133 |
| Scientific notation | 9.2476 × |
92476 in other forms
| Form | Value |
|---|---|
| In words | ninety-two thousand four hundred and seventy-six |
| Binary (base 2) | 10110100100111100 |
| Octal (base 8) | 264474 |
| Hexadecimal (base 16) | 1693C |
| Base 3 | 11200212001 |
| As time | 92476 seconds = 25 h 41 min 16 s |
Is 92476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (92476 ÷ 2 = 46238) | 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 | Yes (92476 ÷ 4 = 23119) | 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 6) | 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 4) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 92476 a prime number?
No. 92476 = × 61 × 379, so it is divisible by 2.
What are the factors of 92476?
1, 2, 4, 61, 122, 244, 379, 758, 1516, 23119, 46238, 92476.
What is 92476 in binary?
10110100100111100 (hexadecimal 1693C, octal 264474).
What is the square root of 92476?
About 304.0987, exactly 2√23119.
Is 92476 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 92476?
It is a composite number with 12 divisors.