Search a number
-
+
5011050110 = 251150119091
BaseRepresentation
bin1001010101010111…
…01000111001111110
3110221020011201110112
410222223220321332
540230312100420
62145124110022
7235115136353
oct45253507176
913836151415
105011050110
112141675130
12b7a235312
1361b22a411
1435773a62a
151e4dda8c5
hex12aae8e7e

5011050110 has 32 divisors (see below), whose sum is σ = 9842926464. Its totient is φ = 1821636000.

The previous prime is 5011050103. The next prime is 5011050113. The reversal of 5011050110 is 110501105.

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

It is a congruent number.

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

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

Almost surely, 25011050110 is an apocalyptic number.

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

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

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

The sum of its prime factors is 14120.

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

The square root of 5011050110 is about 70788.7710728192. The cubic root of 5011050110 is about 1711.2347146505.

Adding to 5011050110 its reverse (110501105), we get a palindrome (5121551215).

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

Divisors: 1 2 5 10 11 22 55 110 5011 9091 10022 18182 25055 45455 50110 55121 90910 100001 110242 200002 275605 500005 551210 1000010 45555001 91110002 227775005 455550010 501105011 1002210022 2505525055 5011050110