Base | Representation |
---|---|
bin | 1001100001010010… |
… | …10101110110111111 |
3 | 111012012110100100020 |
4 | 10300221111312333 |
5 | 40431421023403 |
6 | 2203100503223 |
7 | 240441504360 |
oct | 46051256677 |
9 | 14165410306 |
10 | 5111111103 |
11 | 21930a846a |
12 | ba784ab13 |
13 | 635b928c7 |
14 | 366b45b67 |
15 | 1edaa3453 |
hex | 130a55dbf |
5111111103 has 8 divisors (see below), whose sum is σ = 7788359808. Its totient is φ = 2920634904.
The previous prime is 5111111101. The next prime is 5111111141. The reversal of 5111111103 is 3011111115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5111111103 - 21 = 5111111101 is a prime.
It is a super-2 number, since 2×51111111032 = 52246913414419753218, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5111111101) 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 7 ways as a sum of consecutive naturals, for example, 121693101 + ... + 121693142.
It is an arithmetic number, because the mean of its divisors is an integer number (973544976).
Almost surely, 25111111103 is an apocalyptic number.
5111111103 is a deficient number, since it is larger than the sum of its proper divisors (2677248705).
5111111103 is a wasteful number, since it uses less digits than its factorization.
5111111103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243386253.
The product of its (nonzero) digits is 15, while the sum is 15.
The square root of 5111111103 is about 71492.0352416967. The cubic root of 5111111103 is about 1722.5497498767.
Adding to 5111111103 its reverse (3011111115), we get a palindrome (8122222218).
The spelling of 5111111103 in words is "five billion, one hundred eleven million, one hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •