The number 1466
1466 is a composite number with 4 divisors. Its prime factorisation is 2 × 733. Divisors (4): 1, 2, 733, 1466.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1466: a semiprime: 2 × 733, the product of two primes.
- 2
1466 is composite. Its prime factorisation is
- 3
The divisors add up to 2202; without 1466 itself that is 736, so 1466 is deficient (736 is less than 1466). Euler's totient φ(1466) = 732 numbers up to 1466 share no factor with it.
- 4
The digits of 1466 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1466 = 2 \times 733 \]
1466 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2202 |
| Euler totient φ(n) | 732 |
| Square | 2149156 |
| Cube | 3150662696 |
| Square root | 38.288379 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 96 |
| Scientific notation | 1.466 × |
1466 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and sixty-six |
| Roman numerals | MCDLXVI |
| Binary (base 2) | 10110111010 |
| Octal (base 8) | 2672 |
| Hexadecimal (base 16) | 5BA |
| Base 3 | 2000022 |
| As time | 1466 seconds = 24 min 26 s |
Is 1466 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1466 ÷ 2 = 733) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1466 a prime number?
No. 1466 = 2 × 733, so it is divisible by 2.
What are the factors of 1466?
1, 2, 733, 1466.
What is 1466 in binary?
10110111010 (hexadecimal 5BA, octal 2672).
What is the square root of 1466?
About 38.2884.
What is 1466 in Roman numerals?
MCDLXVI.
Is 1466 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 1466?
1466 is a semiprime: 2 × 733, the product of two primes.