The number 45453
45453 is a binary palindrome (1011000110001101). Its prime factorisation is 3 × 109 × 139. Divisors (8): 1, 3, 109, 139, 327, 417, 15151, 45453.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 45453: a binary palindrome (1011000110001101); a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
45453 is composite. Its prime factorisation is
- 3
The divisors add up to 61600; without 45453 itself that is 16147, so 45453 is deficient (16147 is less than 45453). Euler's totient φ(45453) = 29808 numbers up to 45453 share no factor with it.
- 4
The digits of 45453 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45453 = 3 \times 109 \times 139 \]
45453 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 61600 |
| Euler totient φ(n) | 29808 |
| Square | 2065975209 |
| Cube | 93904771174677 |
| Square root | 213.197092 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.5453 × |
45453 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand four hundred and fifty-three |
| Binary (base 2) | 1011000110001101 |
| Octal (base 8) | 130615 |
| Hexadecimal (base 16) | B18D |
| Base 3 | 2022100110 |
| As time | 45453 seconds = 12 h 37 min 33 s |
Is 45453 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 (45453 ÷ 3 = 15151) | 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 3) | 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 2) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 45453 a prime number?
No. 45453 = 3 × 109 × 139, so it is divisible by 3.
What are the factors of 45453?
1, 3, 109, 139, 327, 417, 15151, 45453.
What is 45453 in binary?
1011000110001101 (hexadecimal B18D, octal 130615).
What is the square root of 45453?
About 213.1971.
Is 45453 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 45453?
45453 is a binary palindrome (1011000110001101); a happy number: repeatedly adding the squares of its digits reaches 1.