The number 79469
79469 is a composite number with 4 divisors. Its prime factorisation is 13 × 6113. Divisors (4): 1, 13, 6113, 79469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 79469: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 6113, the product of two primes.
- 2
79469 is composite. Its prime factorisation is
- 3
The divisors add up to 85596; without 79469 itself that is 6127, so 79469 is deficient (6127 is less than 79469). Euler's totient φ(79469) = 73344 numbers up to 79469 share no factor with it.
- 4
The digits of 79469 add up to 35, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 125 steps to reach 1.
LaTeX source of the formulas on this page
\[ 79469 = 13 \times 6113 \]
79469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 85596 |
| Euler totient φ(n) | 73344 |
| Square | 6315321961 |
| Cube | 501872320918709 |
| Square root | 281.902465 |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 125 |
| Scientific notation | 7.9469 × |
79469 in other forms
| Form | Value |
|---|---|
| In words | seventy-nine thousand four hundred and sixty-nine |
| Binary (base 2) | 10011011001101101 |
| Octal (base 8) | 233155 |
| Hexadecimal (base 16) | 1366D |
| Base 3 | 11001000022 |
| As time | 79469 seconds = 22 h 4 min 29 s |
Is 79469 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 5) | 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 79469 a prime number?
No. 79469 = 13 × 6113, so it is divisible by 13.
What are the factors of 79469?
1, 13, 6113, 79469.
What is 79469 in binary?
10011011001101101 (hexadecimal 1366D, octal 233155).
What is the square root of 79469?
About 281.9025.
Is 79469 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 79469?
79469 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 6113, the product of two primes.