The number 99507
99507 is a composite number with 8 divisors. Its prime factorisation is 3 × 41 × 809. Divisors (8): 1, 3, 41, 123, 809, 2427, 33169, 99507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 99507: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
99507 is composite. Its prime factorisation is
- 3
The divisors add up to 136080; without 99507 itself that is 36573, so 99507 is deficient (36573 is less than 99507). Euler's totient φ(99507) = 64640 numbers up to 99507 share no factor with it.
- 4
The digits of 99507 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 99507 = 3 \times 41 \times 809 \]
99507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 136080 |
| Euler totient φ(n) | 64640 |
| Square | 9901643049 |
| Cube | 985282794876843 |
| Square root | 315.447301 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.9507 × |
99507 in other forms
| Form | Value |
|---|---|
| In words | ninety-nine thousand five hundred and seven |
| Binary (base 2) | 11000010010110011 |
| Octal (base 8) | 302263 |
| Hexadecimal (base 16) | 184B3 |
| Base 3 | 12001111110 |
| As time | 99507 seconds = 27 h 38 min 27 s |
Is 99507 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 | Yes (99507 ÷ 3 = 33169) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 99507 a prime number?
No. 99507 = 3 × 41 × 809, so it is divisible by 3.
What are the factors of 99507?
1, 3, 41, 123, 809, 2427, 33169, 99507.
What is 99507 in binary?
11000010010110011 (hexadecimal 184B3, octal 302263).
What is the square root of 99507?
About 315.4473.
Is 99507 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 99507?
99507 is a happy number: repeatedly adding the squares of its digits reaches 1.