Search a number
-
+
50050001105 = 513770000017
BaseRepresentation
bin101110100111001101…
…100110100011010001
311210012001220111020122
4232213031212203101
51310000300013410
634554225120025
73421166663366
oct564715464321
9153161814218
1050050001105
111a253a14685
129849789015
134948228790
1425cb22846d
15147de6ee55
hexba73668d1

50050001105 has 8 divisors (see below), whose sum is σ = 64680001512. Its totient is φ = 36960000768.

The previous prime is 50050001101. The next prime is 50050001137. The reversal of 50050001105 is 50110005005.

It can be written as a sum of positive squares in 4 ways, for example, as 84787264 + 49965213841 = 9208^2 + 223529^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 50050001105 - 22 = 50050001101 is a prime.

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

It is a Duffinian number.

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

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

Almost surely, 250050001105 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 770000035.

The product of its (nonzero) digits is 125, while the sum is 17.

The spelling of 50050001105 in words is "fifty billion, fifty million, one thousand, one hundred five".

Divisors: 1 5 13 65 770000017 3850000085 10010000221 50050001105