The number 45071
45071 is a composite number with 4 divisors. Its prime factorisation is 13 × 3467. Divisors (4): 1, 13, 3467, 45071.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 45071: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 3467, the product of two primes.
- 2
45071 is composite. Its prime factorisation is
- 3
The divisors add up to 48552; without 45071 itself that is 3481, so 45071 is deficient (3481 is less than 45071). Euler's totient φ(45071) = 41592 numbers up to 45071 share no factor with it.
- 4
The digits of 45071 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 62 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45071 = 13 \times 3467 \]
45071 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 48552 |
| Euler totient φ(n) | 41592 |
| Square | 2031395041 |
| Cube | 91557005892911 |
| Square root | 212.299317 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 62 |
| Scientific notation | 4.5071 × |
45071 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand and seventy-one |
| Binary (base 2) | 1011000000001111 |
| Octal (base 8) | 130017 |
| Hexadecimal (base 16) | B00F |
| Base 3 | 2021211022 |
| As time | 45071 seconds = 12 h 31 min 11 s |
Is 45071 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 5) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 4) | 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 45071 a prime number?
No. 45071 = 13 × 3467, so it is divisible by 13.
What are the factors of 45071?
1, 13, 3467, 45071.
What is 45071 in binary?
1011000000001111 (hexadecimal B00F, octal 130017).
What is the square root of 45071?
About 212.2993.
Is 45071 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 45071?
45071 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 3467, the product of two primes.