The number 76915
76915 is a composite number with 4 divisors. Its prime factorisation is 5 × 15383. Divisors (4): 1, 5, 15383, 76915.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 76915: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 15383, the product of two primes.
- 2
76915 is composite. Its prime factorisation is
- 3
The divisors add up to 92304; without 76915 itself that is 15389, so 76915 is deficient (15389 is less than 76915). Euler's totient φ(76915) = 61528 numbers up to 76915 share no factor with it.
- 4
The digits of 76915 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 169 steps to reach 1.
LaTeX source of the formulas on this page
\[ 76915 = 5 \times 15383 \]
76915 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 92304 |
| Euler totient φ(n) | 61528 |
| Square | 5915917225 |
| Cube | 455022773360875 |
| Square root | 277.335537 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 169 |
| Scientific notation | 7.6915 × |
76915 in other forms
| Form | Value |
|---|---|
| In words | seventy-six thousand nine hundred and fifteen |
| Binary (base 2) | 10010110001110011 |
| Octal (base 8) | 226163 |
| Hexadecimal (base 16) | 12C73 |
| Base 3 | 10220111201 |
| As time | 76915 seconds = 21 h 21 min 55 s |
Is 76915 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 | Yes (76915 ÷ 5 = 15383) | 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 6) | 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 3) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 76915 a prime number?
No. 76915 = 5 × 15383, so it is divisible by 5.
What are the factors of 76915?
1, 5, 15383, 76915.
What is 76915 in binary?
10010110001110011 (hexadecimal 12C73, octal 226163).
What is the square root of 76915?
About 277.3355.
Is 76915 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 76915?
76915 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 15383, the product of two primes.