Search a number
-
+
50110501550 = 2521002210031
BaseRepresentation
bin101110101010110100…
…011001001010101110
311210100021202020020212
4232222310121022232
51310111242022200
635004225542422
73422533143464
oct565264311256
9153307666225
1050110501550
111a28508754a
129865aa4a12
13495791c465
1425d5296834
151484421035
hexbaad192ae

50110501550 has 12 divisors (see below), whose sum is σ = 93205532976. Its totient is φ = 20044200600.

The previous prime is 50110501531. The next prime is 50110501591. The reversal of 50110501550 is 5510501105.

It is a happy number.

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

It is a congruent number.

It is an unprimeable number.

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 5 ways as a sum of consecutive naturals, for example, 501104966 + ... + 501105065.

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

Almost surely, 250110501550 is an apocalyptic number.

50110501550 is a gapful number since it is divisible by the number (50) formed by its first and last digit.

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

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

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

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

The product of its (nonzero) digits is 625, while the sum is 23.

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

Divisors: 1 2 5 10 25 50 1002210031 2004420062 5011050155 10022100310 25055250775 50110501550