The number 51507
51507 is a composite number with 12 divisors. Its prime factorisation is × 59 × 97. Divisors (12): 1, 3, 9, 59, 97, 177, 291, 531, 873, 5723, 17169, 51507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51507: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
51507 is composite. Its prime factorisation is
- 3
The divisors add up to 76440; without 51507 itself that is 24933, so 51507 is deficient (24933 is less than 51507). Euler's totient φ(51507) = 33408 numbers up to 51507 share no factor with it.
- 4
The digits of 51507 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51507 = 3^{2} \times 59 \times 97 \]51507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 76440 |
| Euler totient φ(n) | 33408 |
| Square | 2652971049 |
| Cube | 136646579820843 |
| Square root | 226.951537 (= 3√5723) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.1507 × |
51507 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and seven |
| Binary (base 2) | 1100100100110011 |
| Octal (base 8) | 144463 |
| Hexadecimal (base 16) | C933 |
| Base 3 | 2121122200 |
| As time | 51507 seconds = 14 h 18 min 27 s |
Is 51507 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 (51507 ÷ 3 = 17169) | 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 1) | 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 | Yes (51507 ÷ 9 = 5723) | 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 5) | 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 51507 a prime number?
No. 51507 = × 59 × 97, so it is divisible by 3.
What are the factors of 51507?
1, 3, 9, 59, 97, 177, 291, 531, 873, 5723, 17169, 51507.
What is 51507 in binary?
1100100100110011 (hexadecimal C933, octal 144463).
What is the square root of 51507?
About 226.9515, exactly 3√5723.
Is 51507 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 51507?
51507 is a happy number: repeatedly adding the squares of its digits reaches 1.