Search a number
-
+
5001111110 = 251979252709
BaseRepresentation
bin1001010100001011…
…01110011001000110
3110220112110202201102
410222011232121012
540220241023420
62144131100102
7234634512602
oct45205563106
913815422642
105001111110
112136aa6886
12b76a41632
1361915a558
143562b0502
151e40c5a75
hex12a16e646

5001111110 has 16 divisors (see below), whose sum is σ = 9006584400. Its totient is φ = 1999425696.

The previous prime is 5001111109. The next prime is 5001111113. The reversal of 5001111110 is 111111005.

It is a happy number.

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

It is a junction number, because it is equal to n+sod(n) for n = 5001111091 and 5001111100.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 106565 + ... + 146144.

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

Almost surely, 25001111110 is an apocalyptic number.

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

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

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

The sum of its prime factors is 254695.

The product of its (nonzero) digits is 5, while the sum is 11.

The square root of 5001111110 is about 70718.5344163749. The cubic root of 5001111110 is about 1710.1026020536.

Adding to 5001111110 its reverse (111111005), we get a palindrome (5112222115).

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

Divisors: 1 2 5 10 1979 3958 9895 19790 252709 505418 1263545 2527090 500111111 1000222222 2500555555 5001111110