The number 1469
1469 is a composite number with 4 divisors. Its prime factorisation is 13 × 113. Divisors (4): 1, 13, 113, 1469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1469: a semiprime: 13 × 113, the product of two primes.
- 2
1469 is composite. Its prime factorisation is
- 3
The divisors add up to 1596; without 1469 itself that is 127, so 1469 is deficient (127 is less than 1469). Euler's totient φ(1469) = 1344 numbers up to 1469 share no factor with it.
- 4
The digits of 1469 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1469 = 13 \times 113 \]
1469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1596 |
| Euler totient φ(n) | 1344 |
| Square | 2157961 |
| Cube | 3170044709 |
| Square root | 38.327536 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 47 |
| Scientific notation | 1.469 × |
1469 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and sixty-nine |
| Roman numerals | MCDLXIX |
| Binary (base 2) | 10110111101 |
| Octal (base 8) | 2675 |
| Hexadecimal (base 16) | 5BD |
| Base 3 | 2000102 |
| As time | 1469 seconds = 24 min 29 s |
Is 1469 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1469 a prime number?
No. 1469 = 13 × 113, so it is divisible by 13.
What are the factors of 1469?
1, 13, 113, 1469.
What is 1469 in binary?
10110111101 (hexadecimal 5BD, octal 2675).
What is the square root of 1469?
About 38.3275.
What is 1469 in Roman numerals?
MCDLXIX.
Is 1469 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 1469?
1469 is a semiprime: 13 × 113, the product of two primes.