The number 91504
91504 is a composite number with 40 divisors. Its prime factorisation is × 7 × 19 × 43. Divisors (40): 1, 2, 4, 7, 8, 14, 16, 19, 28, 38, 43, 56, 76, 86, 112, 133 … 91504.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91504: a Harshad number: divisible by its digit sum 19.
- 2
91504 is composite. Its prime factorisation is
- 3
The divisors add up to 218240; without 91504 itself that is 126736, so 91504 is abundant (126736 is more than 91504). Euler's totient φ(91504) = 36288 numbers up to 91504 share no factor with it.
- 4
The digits of 91504 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 91504 = 2^{4} \times 7 \times 19 \times 43 \]91504 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 218240 |
| Euler totient φ(n) | 36288 |
| Square | 8372982016 |
| Cube | 766161346392064 |
| Square root | 302.496281 (= 4√5719) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.1504 × |
91504 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand five hundred and four |
| Binary (base 2) | 10110010101110000 |
| Octal (base 8) | 262560 |
| Hexadecimal (base 16) | 16570 |
| Base 3 | 11122112001 |
| As time | 91504 seconds = 25 h 25 min 4 s |
Is 91504 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (91504 ÷ 2 = 45752) | 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 (91504 ÷ 4 = 22876) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 | Yes (91504 ÷ 7 = 13072) | 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 (91504 ÷ 8 = 11438) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 91504 a prime number?
No. 91504 = × 7 × 19 × 43, so it is divisible by 2.
What are the factors of 91504?
1, 2, 4, 7, 8, 14, 16, 19, 28, 38, 43, 56, 76, 86, 112, 133, 152, 172, 266, 301, 304, 344, 532, 602, 688, 817, 1064, 1204, 1634, 2128, 2408, 3268, 4816, 5719, 6536, 11438, 13072, 22876, 45752, 91504.
What is 91504 in binary?
10110010101110000 (hexadecimal 16570, octal 262560).
What is the square root of 91504?
About 302.4963, exactly 4√5719.
Is 91504 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 91504?
91504 is a Harshad number: divisible by its digit sum 19.