The number 52151
52151 is a composite number with 6 divisors. Its prime factorisation is Ć 431. Divisors (6): 1, 11, 121, 431, 4741, 52151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
52151 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
52151 is composite. Its prime factorisation is
- 3
The divisors add up to 57456; without 52151 itself that is 5305, so 52151 is deficient (5305 is less than 52151). Euler's totient Ļ(52151) = 47300 numbers up to 52151 share no factor with it.
- 4
The digits of 52151 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52151 = 11^{2} \times 431 \]52151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 57456 |
| Euler totient Ļ(n) | 47300 |
| Square | 2719726801 |
| Cube | 141836472398951 |
| Square root | 228.365934 (= 11ā431) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.2151 Ć |
52151 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand one hundred and fifty-one |
| Binary (base 2) | 1100101110110111 |
| Octal (base 8) | 145667 |
| Hexadecimal (base 16) | CBB7 |
| Base 3 | 2122112112 |
| As time | 52151 seconds = 14 h 29 min 11 s |
Is 52151 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 1) | 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 5) | 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 | Yes (52151 Ć· 11 = 4741) | 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 52151 a prime number?
No. 52151 = Ć 431, so it is divisible by 11.
What are the factors of 52151?
1, 11, 121, 431, 4741, 52151.
What is 52151 in binary?
1100101110110111 (hexadecimal CBB7, octal 145667).
What is the square root of 52151?
About 228.3659, exactly 11ā431.
Is 52151 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 52151?
It is a composite number with 6 divisors.