The number 25072
25072 is a composite number with 10 divisors. Its prime factorisation is × 1567. Divisors (10): 1, 2, 4, 8, 16, 1567, 3134, 6268, 12536, 25072.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25072: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 16.
- 2
25072 is composite. Its prime factorisation is
- 3
The divisors add up to 48608; without 25072 itself that is 23536, so 25072 is deficient (23536 is less than 25072). Euler's totient φ(25072) = 12528 numbers up to 25072 share no factor with it.
- 4
The digits of 25072 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 64 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25072 = 2^{4} \times 1567 \]25072 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 48608 |
| Euler totient φ(n) | 12528 |
| Square | 628605184 |
| Cube | 15760389173248 |
| Square root | 158.341403 (= 4√1567) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 64 |
| Scientific notation | 2.5072 × |
25072 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand and seventy-two |
| Binary (base 2) | 110000111110000 |
| Octal (base 8) | 60760 |
| Hexadecimal (base 16) | 61F0 |
| Base 3 | 1021101121 |
| As time | 25072 seconds = 6 h 57 min 52 s |
Is 25072 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (25072 ÷ 2 = 12536) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (25072 ÷ 4 = 6268) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (25072 ÷ 8 = 3134) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25072 a prime number?
No. 25072 = × 1567, so it is divisible by 2.
What are the factors of 25072?
1, 2, 4, 8, 16, 1567, 3134, 6268, 12536, 25072.
What is 25072 in binary?
110000111110000 (hexadecimal 61F0, octal 60760).
What is the square root of 25072?
About 158.3414, exactly 4√1567.
Is 25072 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 25072?
25072 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 16.