The number 97483
97483 is a composite number with 4 divisors. Its prime factorisation is 71 × 1373. Divisors (4): 1, 71, 1373, 97483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 97483: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 1373, the product of two primes.
- 2
97483 is composite. Its prime factorisation is
- 3
The divisors add up to 98928; without 97483 itself that is 1445, so 97483 is deficient (1445 is less than 97483). Euler's totient φ(97483) = 96040 numbers up to 97483 share no factor with it.
- 4
The digits of 97483 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 97483 = 71 \times 1373 \]
97483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 98928 |
| Euler totient φ(n) | 96040 |
| Square | 9502935289 |
| Cube | 926374640777587 |
| Square root | 312.222677 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.7483 × |
97483 in other forms
| Form | Value |
|---|---|
| In words | ninety-seven thousand four hundred and eighty-three |
| Binary (base 2) | 10111110011001011 |
| Octal (base 8) | 276313 |
| Hexadecimal (base 16) | 17CCB |
| Base 3 | 11221201111 |
| As time | 97483 seconds = 27 h 4 min 43 s |
Is 97483 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 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 4) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 97483 a prime number?
No. 97483 = 71 × 1373, so it is divisible by 71.
What are the factors of 97483?
1, 71, 1373, 97483.
What is 97483 in binary?
10111110011001011 (hexadecimal 17CCB, octal 276313).
What is the square root of 97483?
About 312.2227.
Is 97483 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 97483?
97483 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 1373, the product of two primes.