The number 79483
79483 is a composite number with 4 divisors. Its prime factorisation is 61 × 1303. Divisors (4): 1, 61, 1303, 79483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 79483: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 1303, the product of two primes.
- 2
79483 is composite. Its prime factorisation is
- 3
The divisors add up to 80848; without 79483 itself that is 1365, so 79483 is deficient (1365 is less than 79483). Euler's totient φ(79483) = 78120 numbers up to 79483 share no factor with it.
- 4
The digits of 79483 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 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 79483 = 61 \times 1303 \]
79483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 80848 |
| Euler totient φ(n) | 78120 |
| Square | 6317547289 |
| Cube | 502137611171587 |
| Square root | 281.927296 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 120 |
| Scientific notation | 7.9483 × |
79483 in other forms
| Form | Value |
|---|---|
| In words | seventy-nine thousand four hundred and eighty-three |
| Binary (base 2) | 10011011001111011 |
| Octal (base 8) | 233173 |
| Hexadecimal (base 16) | 1367B |
| Base 3 | 11001000211 |
| As time | 79483 seconds = 22 h 4 min 43 s |
Is 79483 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 3) | 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 5) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 79483 a prime number?
No. 79483 = 61 × 1303, so it is divisible by 61.
What are the factors of 79483?
1, 61, 1303, 79483.
What is 79483 in binary?
10011011001111011 (hexadecimal 1367B, octal 233173).
What is the square root of 79483?
About 281.9273.
Is 79483 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 79483?
79483 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 1303, the product of two primes.