Search a number
-
+
271550057 = 1072537851
BaseRepresentation
bin10000001011111…
…000011001101001
3200220222011122112
4100023320121221
51024004100212
642540132105
76505065062
oct2013703151
9626864575
10271550057
1112a312639
1276b37035
134434950c
14280c9569
1518c8e422
hex102f8669

271550057 has 4 divisors (see below), whose sum is σ = 274088016. Its totient is φ = 269012100.

The previous prime is 271550053. The next prime is 271550077. The reversal of 271550057 is 750055172.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 271550057 - 22 = 271550053 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (271550051) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1268819 + ... + 1269032.

It is an arithmetic number, because the mean of its divisors is an integer number (68522004).

Almost surely, 2271550057 is an apocalyptic number.

It is an amenable number.

271550057 is a deficient number, since it is larger than the sum of its proper divisors (2537959).

271550057 is a wasteful number, since it uses less digits than its factorization.

271550057 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 2537958.

The product of its (nonzero) digits is 12250, while the sum is 32.

The square root of 271550057 is about 16478.7759557559. The cubic root of 271550057 is about 647.5648982123.

The spelling of 271550057 in words is "two hundred seventy-one million, five hundred fifty thousand, fifty-seven".

Divisors: 1 107 2537851 271550057