The number 45371
45371 is a composite number with 4 divisors. Its prime factorisation is 59 × 769. Divisors (4): 1, 59, 769, 45371.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 45371: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 59 × 769, the product of two primes.
- 2
45371 is composite. Its prime factorisation is
- 3
The divisors add up to 46200; without 45371 itself that is 829, so 45371 is deficient (829 is less than 45371). Euler's totient φ(45371) = 44544 numbers up to 45371 share no factor with it.
- 4
The digits of 45371 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
\[ 45371 = 59 \times 769 \]
45371 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 46200 |
| Euler totient φ(n) | 44544 |
| Square | 2058527641 |
| Cube | 93397457599811 |
| Square root | 213.004695 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.5371 × |
45371 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand three hundred and seventy-one |
| Binary (base 2) | 1011000100111011 |
| Octal (base 8) | 130473 |
| Hexadecimal (base 16) | B13B |
| Base 3 | 2022020102 |
| As time | 45371 seconds = 12 h 36 min 11 s |
Is 45371 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 3) | 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 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 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 45371 a prime number?
No. 45371 = 59 × 769, so it is divisible by 59.
What are the factors of 45371?
1, 59, 769, 45371.
What is 45371 in binary?
1011000100111011 (hexadecimal B13B, octal 130473).
What is the square root of 45371?
About 213.0047.
Is 45371 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 45371?
45371 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 59 × 769, the product of two primes.