The number 16259
16259 is a composite number with 4 divisors. Its prime factorisation is 71 × 229. Divisors (4): 1, 71, 229, 16259.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16259: a semiprime: 71 × 229, the product of two primes.
- 2
16259 is composite. Its prime factorisation is
- 3
The divisors add up to 16560; without 16259 itself that is 301, so 16259 is deficient (301 is less than 16259). Euler's totient φ(16259) = 15960 numbers up to 16259 share no factor with it.
- 4
The digits of 16259 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16259 = 71 \times 229 \]
16259 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16560 |
| Euler totient φ(n) | 15960 |
| Square | 264355081 |
| Cube | 4298149261979 |
| Square root | 127.510784 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.6259 × |
16259 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand two hundred and fifty-nine |
| Binary (base 2) | 11111110000011 |
| Octal (base 8) | 37603 |
| Hexadecimal (base 16) | 3F83 |
| Base 3 | 211022012 |
| As time | 16259 seconds = 4 h 30 min 59 s |
Is 16259 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 2) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 | No (remainder 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16259 a prime number?
No. 16259 = 71 × 229, so it is divisible by 71.
What are the factors of 16259?
1, 71, 229, 16259.
What is 16259 in binary?
11111110000011 (hexadecimal 3F83, octal 37603).
What is the square root of 16259?
About 127.5108.
Is 16259 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 16259?
16259 is a semiprime: 71 × 229, the product of two primes.