Search a number
-
+
50105011061 = 7607219427
BaseRepresentation
bin101110101010011111…
…011100101101110101
311210022220102021201102
4232222133130231311
51310103340323221
635003512135445
73422435365310
oct565237345565
9153286367642
1050105011061
111a281a77456
129864097585
134956749351
1425d4667977
151483bd930b
hexbaa7dcb75

50105011061 has 12 divisors (see below), whose sum is σ = 57360315168. Its totient is φ = 42874192152.

The previous prime is 50105011057. The next prime is 50105011063. The reversal of 50105011061 is 16011050105.

It is not a de Polignac number, because 50105011061 - 22 = 50105011057 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (50105011063) 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 11 ways as a sum of consecutive naturals, for example, 2569430 + ... + 2588856.

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

Almost surely, 250105011061 is an apocalyptic number.

It is an amenable number.

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

50105011061 is an frugal number, since it uses more digits than its factorization.

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

The sum of its prime factors is 20648 (or 20041 counting only the distinct ones).

The product of its (nonzero) digits is 150, while the sum is 20.

Adding to 50105011061 its reverse (16011050105), we get a palindrome (66116061166).

The spelling of 50105011061 in words is "fifty billion, one hundred five million, eleven thousand, sixty-one".

Divisors: 1 7 607 4249 19427 135989 368449 2579143 11792189 82545323 7157858723 50105011061