The number 45461
45461 is a composite number with 6 divisors. Its prime factorisation is Ć 269. Divisors (6): 1, 13, 169, 269, 3497, 45461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 45461: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
45461 is composite. Its prime factorisation is
- 3
The divisors add up to 49410; without 45461 itself that is 3949, so 45461 is deficient (3949 is less than 45461). Euler's totient Ļ(45461) = 41808 numbers up to 45461 share no factor with it.
- 4
The digits of 45461 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 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45461 = 13^{2} \times 269 \]45461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 49410 |
| Euler totient Ļ(n) | 41808 |
| Square | 2066702521 |
| Cube | 93954363307181 |
| Square root | 213.215853 (= 13ā269) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.5461 Ć |
45461 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand four hundred and sixty-one |
| Binary (base 2) | 1011000110010101 |
| Octal (base 8) | 130625 |
| Hexadecimal (base 16) | B195 |
| Base 3 | 2022100202 |
| As time | 45461 seconds = 12 h 37 min 41 s |
Is 45461 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 1) | 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 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 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 45461 a prime number?
No. 45461 = Ć 269, so it is divisible by 13.
What are the factors of 45461?
1, 13, 169, 269, 3497, 45461.
What is 45461 in binary?
1011000110010101 (hexadecimal B195, octal 130625).
What is the square root of 45461?
About 213.2159, exactly 13ā269.
Is 45461 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 45461?
45461 is a happy number: repeatedly adding the squares of its digits reaches 1.