WordGPT

The number 52271

52271 is a composite number with 4 divisors. Its prime factorisation is 167 × 313. Divisors (4): 1, 167, 313, 52271.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 52271: a semiprime: 167 × 313, the product of two primes.

  2. 2

    52271 is composite. Its prime factorisation is

    52271=167×31352271 = 167 \times 313
  3. 3

    The divisors add up to 52752; without 52271 itself that is 481, so 52271 is deficient (481 is less than 52271). Euler's totient φ(52271) = 51792 numbers up to 52271 share no factor with it.

  4. 4

    The digits of 52271 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 52 steps to reach 1.

LaTeX source of the formulas on this page
\[ 52271 = 167 \times 313 \]

52271 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors52752
Euler totient φ(n)51792
Square2732257441
Cube142817828698511
Square root228.628520
Digit sum / digital root17 / 8
Collatz steps to 152
Scientific notation5.2271 × 10410^{4}

52271 in other forms

FormValue
In wordsfifty-two thousand two hundred and seventy-one
Binary (base 2)1100110000101111
Octal (base 8)146057
Hexadecimal (base 16)CC2F
Base 32122200222
As time52271 seconds = 14 h 31 min 11 s

Is 52271 divisible by 2 to 12?

DivisorAnswerRule
2No (remainder 1)A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8).
3No (remainder 2)A number is divisible by 3 if the digits add up to a multiple of 3.
4No (remainder 3)A number is divisible by 4 if the last two digits make a multiple of 4.
5No (remainder 1)A number is divisible by 5 if the last digit is 0 or 5.
6No (remainder 5)A number is divisible by 6 if it is divisible by both 2 and 3.
7No (remainder 2)A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7.
8No (remainder 7)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 8)A number is divisible by 9 if the digits add up to a multiple of 9.
10No (remainder 1)A number is divisible by 10 if the last digit is 0.
11No (remainder 10)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 11)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 52271 a prime number?

No. 52271 = 167 × 313, so it is divisible by 167.

What are the factors of 52271?

1, 167, 313, 52271.

What is 52271 in binary?

1100110000101111 (hexadecimal CC2F, octal 146057).

What is the square root of 52271?

About 228.6285.

Is 52271 divisible by 3?

No. Its digits add up to 17, which is not a multiple of 3.

What is special about the number 52271?

52271 is a semiprime: 167 × 313, the product of two primes.

Find the next one

Nearby numbers

    52271: is it prime? Factors, square root, binary, Roman numeral | WordGPT