The number 51299
51299 is a composite number with 4 divisors. Its prime factorisation is 43 × 1193. Divisors (4): 1, 43, 1193, 51299.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51299: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 43 × 1193, the product of two primes.
- 2
51299 is composite. Its prime factorisation is
- 3
The divisors add up to 52536; without 51299 itself that is 1237, so 51299 is deficient (1237 is less than 51299). Euler's totient φ(51299) = 50064 numbers up to 51299 share no factor with it.
- 4
The digits of 51299 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51299 = 43 \times 1193 \]
51299 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52536 |
| Euler totient φ(n) | 50064 |
| Square | 2631587401 |
| Cube | 134997802083899 |
| Square root | 226.492825 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.1299 × |
51299 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and ninety-nine |
| Binary (base 2) | 1100100001100011 |
| Octal (base 8) | 144143 |
| Hexadecimal (base 16) | C863 |
| Base 3 | 2121100222 |
| As time | 51299 seconds = 14 h 14 min 59 s |
Is 51299 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51299 a prime number?
No. 51299 = 43 × 1193, so it is divisible by 43.
What are the factors of 51299?
1, 43, 1193, 51299.
What is 51299 in binary?
1100100001100011 (hexadecimal C863, octal 144143).
What is the square root of 51299?
About 226.4928.
Is 51299 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 51299?
51299 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 43 × 1193, the product of two primes.