The number 51099
51099 is a composite number with 4 divisors. Its prime factorisation is 3 × 17033. Divisors (4): 1, 3, 17033, 51099.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51099: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 17033, the product of two primes.
- 2
51099 is composite. Its prime factorisation is
- 3
The divisors add up to 68136; without 51099 itself that is 17037, so 51099 is deficient (17037 is less than 51099). Euler's totient φ(51099) = 34064 numbers up to 51099 share no factor with it.
- 4
The digits of 51099 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51099 = 3 \times 17033 \]
51099 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 68136 |
| Euler totient φ(n) | 34064 |
| Square | 2611107801 |
| Cube | 133424997523299 |
| Square root | 226.050879 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.1099 × |
51099 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and ninety-nine |
| Binary (base 2) | 1100011110011011 |
| Octal (base 8) | 143633 |
| Hexadecimal (base 16) | C79B |
| Base 3 | 2121002120 |
| As time | 51099 seconds = 14 h 11 min 39 s |
Is 51099 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 (51099 ÷ 3 = 17033) | 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 4) | 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 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 6) | 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 4) | 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 51099 a prime number?
No. 51099 = 3 × 17033, so it is divisible by 3.
What are the factors of 51099?
1, 3, 17033, 51099.
What is 51099 in binary?
1100011110011011 (hexadecimal C79B, octal 143633).
What is the square root of 51099?
About 226.0509.
Is 51099 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 51099?
51099 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 17033, the product of two primes.