The number 69913
69913 is a composite number with 4 divisors. Its prime factorisation is 151 × 463. Divisors (4): 1, 151, 463, 69913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69913: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 151 × 463, the product of two primes.
- 2
69913 is composite. Its prime factorisation is
- 3
The divisors add up to 70528; without 69913 itself that is 615, so 69913 is deficient (615 is less than 69913). Euler's totient φ(69913) = 69300 numbers up to 69913 share no factor with it.
- 4
The digits of 69913 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 112 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69913 = 151 \times 463 \]
69913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 70528 |
| Euler totient φ(n) | 69300 |
| Square | 4887827569 |
| Cube | 341722688831497 |
| Square root | 264.410665 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 112 |
| Scientific notation | 6.9913 × |
69913 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand nine hundred and thirteen |
| Binary (base 2) | 10001000100011001 |
| Octal (base 8) | 210431 |
| Hexadecimal (base 16) | 11119 |
| Base 3 | 10112220101 |
| As time | 69913 seconds = 19 h 25 min 13 s |
Is 69913 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 1) | 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 4) | 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 1) | 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 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69913 a prime number?
No. 69913 = 151 × 463, so it is divisible by 151.
What are the factors of 69913?
1, 151, 463, 69913.
What is 69913 in binary?
10001000100011001 (hexadecimal 11119, octal 210431).
What is the square root of 69913?
About 264.4107.
Is 69913 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 69913?
69913 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 151 × 463, the product of two primes.