The number 31496
31496 is a composite number with 16 divisors. Its prime factorisation is × 31 × 127. Divisors (16): 1, 2, 4, 8, 31, 62, 124, 127, 248, 254, 508, 1016, 3937, 7874, 15748, 31496.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
31496 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
31496 is composite. Its prime factorisation is
- 3
The divisors add up to 61440; without 31496 itself that is 29944, so 31496 is deficient (29944 is less than 31496). Euler's totient φ(31496) = 15120 numbers up to 31496 share no factor with it.
- 4
The digits of 31496 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 129 steps to reach 1.
LaTeX source of the formulas on this page
\[ 31496 = 2^{3} \times 31 \times 127 \]31496 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 61440 |
| Euler totient φ(n) | 15120 |
| Square | 991998016 |
| Cube | 31243969511936 |
| Square root | 177.471124 (= 2√7874) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 129 |
| Scientific notation | 3.1496 × |
31496 in other forms
| Form | Value |
|---|---|
| In words | thirty-one thousand four hundred and ninety-six |
| Binary (base 2) | 111101100001000 |
| Octal (base 8) | 75410 |
| Hexadecimal (base 16) | 7B08 |
| Base 3 | 1121012112 |
| As time | 31496 seconds = 8 h 44 min 56 s |
Is 31496 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (31496 ÷ 2 = 15748) | 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 | Yes (31496 ÷ 4 = 7874) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 | Yes (31496 ÷ 8 = 3937) | 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 6) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 31496 a prime number?
No. 31496 = × 31 × 127, so it is divisible by 2.
What are the factors of 31496?
1, 2, 4, 8, 31, 62, 124, 127, 248, 254, 508, 1016, 3937, 7874, 15748, 31496.
What is 31496 in binary?
111101100001000 (hexadecimal 7B08, octal 75410).
What is the square root of 31496?
About 177.4711, exactly 2√7874.
Is 31496 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 31496?
It is a composite number with 16 divisors.