The number 45483
45483 is a composite number with 4 divisors. Its prime factorisation is 3 × 15161. Divisors (4): 1, 3, 15161, 45483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 45483: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 15161, the product of two primes.
- 2
45483 is composite. Its prime factorisation is
- 3
The divisors add up to 60648; without 45483 itself that is 15165, so 45483 is deficient (15165 is less than 45483). Euler's totient φ(45483) = 30320 numbers up to 45483 share no factor with it.
- 4
The digits of 45483 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 207 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45483 = 3 \times 15161 \]
45483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60648 |
| Euler totient φ(n) | 30320 |
| Square | 2068703289 |
| Cube | 94090831693587 |
| Square root | 213.267438 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 207 |
| Scientific notation | 4.5483 × |
45483 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand four hundred and eighty-three |
| Binary (base 2) | 1011000110101011 |
| Octal (base 8) | 130653 |
| Hexadecimal (base 16) | B1AB |
| Base 3 | 2022101120 |
| As time | 45483 seconds = 12 h 38 min 3 s |
Is 45483 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 (45483 ÷ 3 = 15161) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 45483 a prime number?
No. 45483 = 3 × 15161, so it is divisible by 3.
What are the factors of 45483?
1, 3, 15161, 45483.
What is 45483 in binary?
1011000110101011 (hexadecimal B1AB, octal 130653).
What is the square root of 45483?
About 213.2674.
Is 45483 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 45483?
45483 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 15161, the product of two primes.