The number 45469
45469 is a composite number with 4 divisors. Its prime factorisation is 41 × 1109. Divisors (4): 1, 41, 1109, 45469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 45469: a semiprime: 41 × 1109, the product of two primes.
- 2
45469 is composite. Its prime factorisation is
- 3
The divisors add up to 46620; without 45469 itself that is 1151, so 45469 is deficient (1151 is less than 45469). Euler's totient φ(45469) = 44320 numbers up to 45469 share no factor with it.
- 4
The digits of 45469 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45469 = 41 \times 1109 \]
45469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 46620 |
| Euler totient φ(n) | 44320 |
| Square | 2067429961 |
| Cube | 94003972896709 |
| Square root | 213.234613 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.5469 × |
45469 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand four hundred and sixty-nine |
| Binary (base 2) | 1011000110011101 |
| Octal (base 8) | 130635 |
| Hexadecimal (base 16) | B19D |
| Base 3 | 2022101001 |
| As time | 45469 seconds = 12 h 37 min 49 s |
Is 45469 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 1) | 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 1) | 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 5) | 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 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 45469 a prime number?
No. 45469 = 41 × 1109, so it is divisible by 41.
What are the factors of 45469?
1, 41, 1109, 45469.
What is 45469 in binary?
1011000110011101 (hexadecimal B19D, octal 130635).
What is the square root of 45469?
About 213.2346.
Is 45469 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 45469?
45469 is a semiprime: 41 × 1109, the product of two primes.