The number 45451
45451 is a triangular number: 1 + 2 + … + 301 = 45451. Its prime factorisation is 7 × 43 × 151. Divisors (8): 1, 7, 43, 151, 301, 1057, 6493, 45451.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 45451: a triangular number: 1 + 2 + … + 301 = 45451.
- 2
45451 is composite. Its prime factorisation is
- 3
The divisors add up to 53504; without 45451 itself that is 8053, so 45451 is deficient (8053 is less than 45451). Euler's totient φ(45451) = 37800 numbers up to 45451 share no factor with it.
- 4
The digits of 45451 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 207 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45451 = 7 \times 43 \times 151 \]
45451 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 53504 |
| Euler totient φ(n) | 37800 |
| Square | 2065793401 |
| Cube | 93892375868851 |
| Square root | 213.192401 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 207 |
| Scientific notation | 4.5451 × |
45451 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand four hundred and fifty-one |
| Binary (base 2) | 1011000110001011 |
| Octal (base 8) | 130613 |
| Hexadecimal (base 16) | B18B |
| Base 3 | 2022100101 |
| As time | 45451 seconds = 12 h 37 min 31 s |
Is 45451 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (45451 ÷ 7 = 6493) | 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 1) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 45451 a prime number?
No. 45451 = 7 × 43 × 151, so it is divisible by 7.
What are the factors of 45451?
1, 7, 43, 151, 301, 1057, 6493, 45451.
What is 45451 in binary?
1011000110001011 (hexadecimal B18B, octal 130613).
What is the square root of 45451?
About 213.1924.
Is 45451 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 45451?
45451 is a triangular number: 1 + 2 + … + 301 = 45451.