The number 95959
95959 is a palindromic prime: it reads the same backwards and is prime, a twin prime (95957 and 95959 are both prime) and the 9249th prime number. Its only divisors are 1 and 95959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95959: a palindromic prime: it reads the same backwards and is prime; a twin prime (95957 and 95959 are both prime); the 9249th prime number; a palindrome: it reads 95959 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
95959 is prime, so its only factors are 1 and 95959. It is the 9249th prime; the next prime is 95971 and the one before is 95957.
- 3
The divisors add up to 95960; without 95959 itself that is 1, so 95959 is deficient (1 is less than 95959). Euler's totient φ(95959) = 95958 numbers up to 95959 share no factor with it.
- 4
The digits of 95959 add up to 37, 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.
95959 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 95960 |
| Euler totient φ(n) | 95958 |
| Square | 9208129681 |
| Cube | 883602916059079 |
| Square root | 309.772497 |
| Digit sum / digital root | 37 / 1 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.5959 × |
95959 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand nine hundred and fifty-nine |
| Binary (base 2) | 10111011011010111 |
| Octal (base 8) | 273327 |
| Hexadecimal (base 16) | 176D7 |
| Base 3 | 11212122001 |
| As time | 95959 seconds = 26 h 39 min 19 s |
Is 95959 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 4) | 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 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 7) | 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 9) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95959 a prime number?
Yes. 95959 is divisible only by 1 and itself.
What are the factors of 95959?
1, 95959.
What is 95959 in binary?
10111011011010111 (hexadecimal 176D7, octal 273327).
What is the square root of 95959?
About 309.7725.
Is 95959 divisible by 3?
No. Its digits add up to 37, which is not a multiple of 3.
What is special about the number 95959?
95959 is a palindromic prime: it reads the same backwards and is prime; a twin prime (95957 and 95959 are both prime); the 9249th prime number; a palindrome: it reads 95959 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.