Search a number
-
+
50010561051 = 31113944324611
BaseRepresentation
bin101110100100110111…
…001001101000011011
311210002022200201122220
4232210313021220123
51304410200423201
634550255515123
73420210516663
oct564467115033
9153068621586
1050010561051
111a2337267a0
129838528aa3
13493ccc9a79
1425c5cbd1a3
15147a77e036
hexba4dc9a1b

50010561051 has 32 divisors (see below), whose sum is σ = 73434332160. Its totient is φ = 30022231200.

The previous prime is 50010560947. The next prime is 50010561059. The reversal of 50010561051 is 15016501005.

It is not a de Polignac number, because 50010561051 - 27 = 50010560923 is a prime.

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2019736 + ... + 2044346.

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

Almost surely, 250010561051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 25207.

The product of its (nonzero) digits is 750, while the sum is 24.

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

Divisors: 1 3 11 33 139 417 443 1329 1529 4587 4873 14619 24611 61577 73833 184731 270721 677347 812163 2032041 3420929 10262787 10902673 32708019 37630219 112890657 119929403 359788209 1515471547 4546414641 16670187017 50010561051