The number 25363
25363 is a composite number with 4 divisors. Its prime factorisation is 13 × 1951. Divisors (4): 1, 13, 1951, 25363.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 25363: a semiprime: 13 × 1951, the product of two primes.
- 2
25363 is composite. Its prime factorisation is
- 3
The divisors add up to 27328; without 25363 itself that is 1965, so 25363 is deficient (1965 is less than 25363). Euler's totient φ(25363) = 23400 numbers up to 25363 share no factor with it.
- 4
The digits of 25363 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 56 steps to reach 1.
LaTeX source of the formulas on this page
\[ 25363 = 13 \times 1951 \]
25363 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 27328 |
| Euler totient φ(n) | 23400 |
| Square | 643281769 |
| Cube | 16315555507147 |
| Square root | 159.257653 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 56 |
| Scientific notation | 2.5363 × |
25363 in other forms
| Form | Value |
|---|---|
| In words | twenty-five thousand three hundred and sixty-three |
| Binary (base 2) | 110001100010011 |
| Octal (base 8) | 61423 |
| Hexadecimal (base 16) | 6313 |
| Base 3 | 1021210101 |
| As time | 25363 seconds = 7 h 2 min 43 s |
Is 25363 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 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 25363 a prime number?
No. 25363 = 13 × 1951, so it is divisible by 13.
What are the factors of 25363?
1, 13, 1951, 25363.
What is 25363 in binary?
110001100010011 (hexadecimal 6313, octal 61423).
What is the square root of 25363?
About 159.2577.
Is 25363 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 25363?
25363 is a semiprime: 13 × 1951, the product of two primes.