The number 1438
1438 is a composite number with 4 divisors. Its prime factorisation is 2 × 719. Divisors (4): 1, 2, 719, 1438.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1438: a semiprime: 2 × 719, the product of two primes.
- 2
1438 is composite. Its prime factorisation is
- 3
The divisors add up to 2160; without 1438 itself that is 722, so 1438 is deficient (722 is less than 1438). Euler's totient φ(1438) = 718 numbers up to 1438 share no factor with it.
- 4
The digits of 1438 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1438 = 2 \times 719 \]
1438 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2160 |
| Euler totient φ(n) | 718 |
| Square | 2067844 |
| Cube | 2973559672 |
| Square root | 37.920970 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 52 |
| Scientific notation | 1.438 × |
1438 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and thirty-eight |
| Roman numerals | MCDXXXVIII |
| Binary (base 2) | 10110011110 |
| Octal (base 8) | 2636 |
| Hexadecimal (base 16) | 59E |
| Base 3 | 1222021 |
| As time | 1438 seconds = 23 min 58 s |
Is 1438 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1438 ÷ 2 = 719) | 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 2) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1438 a prime number?
No. 1438 = 2 × 719, so it is divisible by 2.
What are the factors of 1438?
1, 2, 719, 1438.
What is 1438 in binary?
10110011110 (hexadecimal 59E, octal 2636).
What is the square root of 1438?
About 37.9210.
What is 1438 in Roman numerals?
MCDXXXVIII.
Is 1438 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 1438?
1438 is a semiprime: 2 × 719, the product of two primes.