The number 1467
1467 is a composite number with 6 divisors. Its prime factorisation is × 163. Divisors (6): 1, 3, 9, 163, 489, 1467.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1467 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1467 is composite. Its prime factorisation is
- 3
The divisors add up to 2132; without 1467 itself that is 665, so 1467 is deficient (665 is less than 1467). Euler's totient φ(1467) = 972 numbers up to 1467 share no factor with it.
- 4
The digits of 1467 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1467 = 3^{2} \times 163 \]1467 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 2132 |
| Euler totient φ(n) | 972 |
| Square | 2152089 |
| Cube | 3157114563 |
| Square root | 38.301436 (= 3√163) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 140 |
| Scientific notation | 1.467 × |
1467 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and sixty-seven |
| Roman numerals | MCDLXVII |
| Binary (base 2) | 10110111011 |
| Octal (base 8) | 2673 |
| Hexadecimal (base 16) | 5BB |
| Base 3 | 2000100 |
| As time | 1467 seconds = 24 min 27 s |
Is 1467 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 | Yes (1467 ÷ 3 = 489) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | Yes (1467 ÷ 9 = 163) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1467 a prime number?
No. 1467 = × 163, so it is divisible by 3.
What are the factors of 1467?
1, 3, 9, 163, 489, 1467.
What is 1467 in binary?
10110111011 (hexadecimal 5BB, octal 2673).
What is the square root of 1467?
About 38.3014, exactly 3√163.
What is 1467 in Roman numerals?
MCDLXVII.
Is 1467 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 1467?
It is a composite number with 6 divisors.