The number 507
507 is a composite number with 6 divisors. Its prime factorisation is 3 Ć . Divisors (6): 1, 3, 13, 39, 169, 507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
507 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
507 is composite. Its prime factorisation is
- 3
The divisors add up to 732; without 507 itself that is 225, so 507 is deficient (225 is less than 507). Euler's totient Ļ(507) = 312 numbers up to 507 share no factor with it.
- 4
The digits of 507 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 35 steps to reach 1.
LaTeX source of the formulas on this page
\[ 507 = 3 \times 13^{2} \]507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 732 |
| Euler totient Ļ(n) | 312 |
| Square | 257049 |
| Cube | 130323843 |
| Square root | 22.516660 (= 13ā3) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 35 |
| Scientific notation | 5.07 Ć |
507 in other forms
| Form | Value |
|---|---|
| In words | five hundred and seven |
| Roman numerals | DVII |
| Binary (base 2) | 111111011 |
| Octal (base 8) | 773 |
| Hexadecimal (base 16) | 1FB |
| Base 3 | 200210 |
| As time | 507 seconds = 8 min 27 s |
Is 507 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 (507 Ć· 3 = 169) | 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 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 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 507 a prime number?
No. 507 = 3 Ć , so it is divisible by 3.
What are the factors of 507?
1, 3, 13, 39, 169, 507.
What is 507 in binary?
111111011 (hexadecimal 1FB, octal 773).
What is the square root of 507?
About 22.5167, exactly 13ā3.
What is 507 in Roman numerals?
DVII.
Is 507 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 507?
It is a composite number with 6 divisors.