The number 31483
31483 is a composite number with 4 divisors. Its prime factorisation is 19 × 1657. Divisors (4): 1, 19, 1657, 31483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 31483: a Harshad number: divisible by its digit sum 19; a semiprime: 19 × 1657, the product of two primes.
- 2
31483 is composite. Its prime factorisation is
- 3
The divisors add up to 33160; without 31483 itself that is 1677, so 31483 is deficient (1677 is less than 31483). Euler's totient φ(31483) = 29808 numbers up to 31483 share no factor with it.
- 4
The digits of 31483 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 129 steps to reach 1.
LaTeX source of the formulas on this page
\[ 31483 = 19 \times 1657 \]
31483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 33160 |
| Euler totient φ(n) | 29808 |
| Square | 991179289 |
| Cube | 31205297555587 |
| Square root | 177.434495 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 129 |
| Scientific notation | 3.1483 × |
31483 in other forms
| Form | Value |
|---|---|
| In words | thirty-one thousand four hundred and eighty-three |
| Binary (base 2) | 111101011111011 |
| Octal (base 8) | 75373 |
| Hexadecimal (base 16) | 7AFB |
| Base 3 | 1121012001 |
| As time | 31483 seconds = 8 h 44 min 43 s |
Is 31483 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 4) | 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 1) | 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 31483 a prime number?
No. 31483 = 19 × 1657, so it is divisible by 19.
What are the factors of 31483?
1, 19, 1657, 31483.
What is 31483 in binary?
111101011111011 (hexadecimal 7AFB, octal 75373).
What is the square root of 31483?
About 177.4345.
Is 31483 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 31483?
31483 is a Harshad number: divisible by its digit sum 19; a semiprime: 19 × 1657, the product of two primes.