The number 53491
53491 is a composite number with 4 divisors. Its prime factorisation is 149 × 359. Divisors (4): 1, 149, 359, 53491.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53491: a semiprime: 149 × 359, the product of two primes.
- 2
53491 is composite. Its prime factorisation is
- 3
The divisors add up to 54000; without 53491 itself that is 509, so 53491 is deficient (509 is less than 53491). Euler's totient φ(53491) = 52984 numbers up to 53491 share no factor with it.
- 4
The digits of 53491 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53491 = 149 \times 359 \]
53491 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 54000 |
| Euler totient φ(n) | 52984 |
| Square | 2861287081 |
| Cube | 153053107249771 |
| Square root | 231.281214 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.3491 × |
53491 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand four hundred and ninety-one |
| Binary (base 2) | 1101000011110011 |
| Octal (base 8) | 150363 |
| Hexadecimal (base 16) | D0F3 |
| Base 3 | 2201101011 |
| As time | 53491 seconds = 14 h 51 min 31 s |
Is 53491 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 1) | 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 4) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53491 a prime number?
No. 53491 = 149 × 359, so it is divisible by 149.
What are the factors of 53491?
1, 149, 359, 53491.
What is 53491 in binary?
1101000011110011 (hexadecimal D0F3, octal 150363).
What is the square root of 53491?
About 231.2812.
Is 53491 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 53491?
53491 is a semiprime: 149 × 359, the product of two primes.