Search a number
-
+
50050110050 = 2525916966139
BaseRepresentation
bin101110100111001110…
…000001001001100010
311210012002010000200122
4232213032001021202
51310000312010200
634554231320242
73421200626123
oct564716011142
9153162100618
1050050110050
111a253a89516
129849820082
134948266245
1425cb25604a
15147de92385
hexba7381262

50050110050 has 24 divisors (see below), whose sum is σ = 94671061200. Its totient is φ = 19680720080.

The previous prime is 50050110029. The next prime is 50050110059. The reversal of 50050110050 is 5001105005.

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8480120 + ... + 8486019.

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

Almost surely, 250050110050 is an apocalyptic number.

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

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

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

50050110050 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 50050110050 its reverse (5001105005), we get a palindrome (55051215055).

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

Divisors: 1 2 5 10 25 50 59 118 295 590 1475 2950 16966139 33932278 84830695 169661390 424153475 848306950 1001002201 2002004402 5005011005 10010022010 25025055025 50050110050