Search a number
-
+
5101110050 = 252641159161
BaseRepresentation
bin1001100000000110…
…01100001100100010
3111011111122020110212
410300003030030202
540421341010200
62202102254122
7240260501651
oct46003141442
914144566425
105101110050
112188497533
12ba4427342
13633aa071a
143656a1198
151ecc7a035
hex1300cc322

5101110050 has 24 divisors (see below), whose sum is σ = 9502926372. Its totient is φ = 2037248000.

The previous prime is 5101110037. The next prime is 5101110061. The reversal of 5101110050 is 500111015.

It can be written as a sum of positive squares in 6 ways, for example, as 4170188929 + 930921121 = 64577^2 + 30511^2 .

It is a super-2 number, since 2×51011100502 = 52042647484422005000, which contains 22 as substring.

It is an unprimeable number.

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

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

Almost surely, 25101110050 is an apocalyptic number.

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

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

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

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

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

The product of its (nonzero) digits is 25, while the sum is 14.

The square root of 5101110050 is about 71422.0557671088. The cubic root of 5101110050 is about 1721.4254959644.

Adding to 5101110050 its reverse (500111015), we get a palindrome (5601221065).

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

Divisors: 1 2 5 10 25 50 641 1282 3205 6410 16025 32050 159161 318322 795805 1591610 3979025 7958050 102022201 204044402 510111005 1020222010 2550555025 5101110050