The number 95069
95069 is a composite number with 8 divisors. Its prime factorisation is 13 × 71 × 103. Divisors (8): 1, 13, 71, 103, 923, 1339, 7313, 95069.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95069 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95069 is composite. Its prime factorisation is
- 3
The divisors add up to 104832; without 95069 itself that is 9763, so 95069 is deficient (9763 is less than 95069). Euler's totient φ(95069) = 85680 numbers up to 95069 share no factor with it.
- 4
The digits of 95069 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95069 = 13 \times 71 \times 103 \]
95069 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 104832 |
| Euler totient φ(n) | 85680 |
| Square | 9038114761 |
| Cube | 859244532213509 |
| Square root | 308.332613 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 102 |
| Scientific notation | 9.5069 × |
95069 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand and sixty-nine |
| Binary (base 2) | 10111001101011101 |
| Octal (base 8) | 271535 |
| Hexadecimal (base 16) | 1735D |
| Base 3 | 11211102002 |
| As time | 95069 seconds = 26 h 24 min 29 s |
Is 95069 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95069 a prime number?
No. 95069 = 13 × 71 × 103, so it is divisible by 13.
What are the factors of 95069?
1, 13, 71, 103, 923, 1339, 7313, 95069.
What is 95069 in binary?
10111001101011101 (hexadecimal 1735D, octal 271535).
What is the square root of 95069?
About 308.3326.
Is 95069 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 95069?
It is a composite number with 8 divisors.