The number 95728
95728 is a composite number with 20 divisors. Its prime factorisation is × 31 × 193. Divisors (20): 1, 2, 4, 8, 16, 31, 62, 124, 193, 248, 386, 496, 772, 1544, 3088, 5983 … 95728.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95728: a Harshad number: divisible by its digit sum 31.
- 2
95728 is composite. Its prime factorisation is
- 3
The divisors add up to 192448; without 95728 itself that is 96720, so 95728 is abundant (96720 is more than 95728). Euler's totient φ(95728) = 46080 numbers up to 95728 share no factor with it.
- 4
The digits of 95728 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 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95728 = 2^{4} \times 31 \times 193 \]95728 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 192448 |
| Euler totient φ(n) | 46080 |
| Square | 9163849984 |
| Cube | 877237031268352 |
| Square root | 309.399418 (= 4√5983) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.5728 × |
95728 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand seven hundred and twenty-eight |
| Binary (base 2) | 10111010111110000 |
| Octal (base 8) | 272760 |
| Hexadecimal (base 16) | 175F0 |
| Base 3 | 11212022111 |
| As time | 95728 seconds = 26 h 35 min 28 s |
Is 95728 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (95728 ÷ 2 = 47864) | 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 (95728 ÷ 4 = 23932) | 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 4) | 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 (95728 ÷ 8 = 11966) | 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 8) | 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 95728 a prime number?
No. 95728 = × 31 × 193, so it is divisible by 2.
What are the factors of 95728?
1, 2, 4, 8, 16, 31, 62, 124, 193, 248, 386, 496, 772, 1544, 3088, 5983, 11966, 23932, 47864, 95728.
What is 95728 in binary?
10111010111110000 (hexadecimal 175F0, octal 272760).
What is the square root of 95728?
About 309.3994, exactly 4√5983.
Is 95728 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 95728?
95728 is a Harshad number: divisible by its digit sum 31.