Search a number
-
+
50061006061 = 114551000551
BaseRepresentation
bin101110100111110111…
…100101010011101101
311210012211121121012121
4232213313211103231
51310011104143221
634555301032541
73421362346663
oct564767452355
9153184547177
1050061006061
111a25a150890
1298513b5751
13494a5ac8a1
1425cc890c33
15147ede5a41
hexba7de54ed

50061006061 has 4 divisors (see below), whose sum is σ = 54612006624. Its totient is φ = 45510005500.

The previous prime is 50061005959. The next prime is 50061006113. The reversal of 50061006061 is 16060016005.

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 50061006061 - 29 = 50061005549 is a prime.

It is a super-2 number, since 2×500610060612 (a number of 22 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 250061006061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4551000562.

The product of its (nonzero) digits is 1080, while the sum is 25.

The spelling of 50061006061 in words is "fifty billion, sixty-one million, six thousand, sixty-one".

Divisors: 1 11 4551000551 50061006061