The number 1468
1468 is a composite number with 6 divisors. Its prime factorisation is × 367. Divisors (6): 1, 2, 4, 367, 734, 1468.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1468 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1468 is composite. Its prime factorisation is
- 3
The divisors add up to 2576; without 1468 itself that is 1108, so 1468 is deficient (1108 is less than 1468). Euler's totient φ(1468) = 732 numbers up to 1468 share no factor with it.
- 4
The digits of 1468 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 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1468 = 2^{2} \times 367 \]1468 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 2576 |
| Euler totient φ(n) | 732 |
| Square | 2155024 |
| Cube | 3163575232 |
| Square root | 38.314488 (= 2√367) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 47 |
| Scientific notation | 1.468 × |
1468 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and sixty-eight |
| Roman numerals | MCDLXVIII |
| Binary (base 2) | 10110111100 |
| Octal (base 8) | 2674 |
| Hexadecimal (base 16) | 5BC |
| Base 3 | 2000101 |
| As time | 1468 seconds = 24 min 28 s |
Is 1468 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1468 ÷ 2 = 734) | 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 | Yes (1468 ÷ 4 = 367) | 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 4) | 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 4) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1468 a prime number?
No. 1468 = × 367, so it is divisible by 2.
What are the factors of 1468?
1, 2, 4, 367, 734, 1468.
What is 1468 in binary?
10110111100 (hexadecimal 5BC, octal 2674).
What is the square root of 1468?
About 38.3145, exactly 2√367.
What is 1468 in Roman numerals?
MCDLXVIII.
Is 1468 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 1468?
It is a composite number with 6 divisors.