The number 42507
42507 is a composite number with 6 divisors. Its prime factorisation is × 4723. Divisors (6): 1, 3, 9, 4723, 14169, 42507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 42507: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
42507 is composite. Its prime factorisation is
- 3
The divisors add up to 61412; without 42507 itself that is 18905, so 42507 is deficient (18905 is less than 42507). Euler's totient φ(42507) = 28332 numbers up to 42507 share no factor with it.
- 4
The digits of 42507 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42507 = 3^{2} \times 4723 \]42507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 61412 |
| Euler totient φ(n) | 28332 |
| Square | 1806845049 |
| Cube | 76803562497843 |
| Square root | 206.172258 (= 3√4723) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 57 |
| Scientific notation | 4.2507 × |
42507 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand five hundred and seven |
| Binary (base 2) | 1010011000001011 |
| Octal (base 8) | 123013 |
| Hexadecimal (base 16) | A60B |
| Base 3 | 2011022100 |
| As time | 42507 seconds = 11 h 48 min 27 s |
Is 42507 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 (42507 ÷ 3 = 14169) | 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 | Yes (42507 ÷ 9 = 4723) | 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 3) | 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 42507 a prime number?
No. 42507 = × 4723, so it is divisible by 3.
What are the factors of 42507?
1, 3, 9, 4723, 14169, 42507.
What is 42507 in binary?
1010011000001011 (hexadecimal A60B, octal 123013).
What is the square root of 42507?
About 206.1723, exactly 3√4723.
Is 42507 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 42507?
42507 is a happy number: repeatedly adding the squares of its digits reaches 1.