The number 95364
95364 is a composite number with 24 divisors. Its prime factorisation is × × 883. Divisors (24): 1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 108, 883, 1766, 2649, 3532 … 95364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95364: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.
- 2
95364 is composite. Its prime factorisation is
- 3
The divisors add up to 247520; without 95364 itself that is 152156, so 95364 is abundant (152156 is more than 95364). Euler's totient φ(95364) = 31752 numbers up to 95364 share no factor with it.
- 4
The digits of 95364 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95364 = 2^{2} \times 3^{3} \times 883 \]95364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 247520 |
| Euler totient φ(n) | 31752 |
| Square | 9094292496 |
| Cube | 867268109588544 |
| Square root | 308.810622 (= 6√2649) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.5364 × |
95364 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand three hundred and sixty-four |
| Binary (base 2) | 10111010010000100 |
| Octal (base 8) | 272204 |
| Hexadecimal (base 16) | 17484 |
| Base 3 | 11211211000 |
| As time | 95364 seconds = 26 h 29 min 24 s |
Is 95364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (95364 ÷ 2 = 47682) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (95364 ÷ 3 = 31788) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (95364 ÷ 4 = 23841) | 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 | Yes (95364 ÷ 6 = 15894) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (95364 ÷ 9 = 10596) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (95364 ÷ 12 = 7947) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95364 a prime number?
No. 95364 = × × 883, so it is divisible by 2.
What are the factors of 95364?
1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 108, 883, 1766, 2649, 3532, 5298, 7947, 10596, 15894, 23841, 31788, 47682, 95364.
What is 95364 in binary?
10111010010000100 (hexadecimal 17484, octal 272204).
What is the square root of 95364?
About 308.8106, exactly 6√2649.
Is 95364 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 95364?
95364 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 27.