Search a number
-
+
572012161061 = 1152001105551
BaseRepresentation
bin10000101001011101001…
…01001110100000100101
32000200110111210112011212
420110232211032200211
533332440103123221
61114440113441205
756216665100645
oct10245645164045
92020414715155
10572012161061
11200652a529a0
1292a39870205
1341c2c409b73
141d98517c525
15ed2cc09b5b
hex852e94e825

572012161061 has 4 divisors (see below), whose sum is σ = 624013266624. Its totient is φ = 520011055500.

The previous prime is 572012161051. The next prime is 572012161073. The reversal of 572012161061 is 160161210275.

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 572012161061 - 238 = 297134254117 is a prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 2572012161061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 52001105562.

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

The spelling of 572012161061 in words is "five hundred seventy-two billion, twelve million, one hundred sixty-one thousand, sixty-one".

Divisors: 1 11 52001105551 572012161061