The number 1459
1459 is the 232nd prime number. Its only divisors are 1 and 1459.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1459: the 232nd prime number.
- 2
1459 is prime, so its only factors are 1 and 1459. It is the 232nd prime; the next prime is 1471 and the one before is 1453.
- 3
The divisors add up to 1460; without 1459 itself that is 1, so 1459 is deficient (1 is less than 1459). Euler's totient φ(1459) = 1458 numbers up to 1459 share no factor with it.
- 4
The digits of 1459 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 34 steps to reach 1.
1459 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 1460 |
| Euler totient φ(n) | 1458 |
| Square | 2128681 |
| Cube | 3105745579 |
| Square root | 38.196859 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 34 |
| Scientific notation | 1.459 × |
1459 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and fifty-nine |
| Roman numerals | MCDLIX |
| Binary (base 2) | 10110110011 |
| Octal (base 8) | 2663 |
| Hexadecimal (base 16) | 5B3 |
| Base 3 | 2000001 |
| As time | 1459 seconds = 24 min 19 s |
Is 1459 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 4) | 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 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 1) | 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 7) | 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 1459 a prime number?
Yes. 1459 is divisible only by 1 and itself.
What are the factors of 1459?
1, 1459.
What is 1459 in binary?
10110110011 (hexadecimal 5B3, octal 2663).
What is the square root of 1459?
About 38.1969.
What is 1459 in Roman numerals?
MCDLIX.
Is 1459 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 1459?
1459 is the 232nd prime number.