Base | Representation |
---|---|
bin | 100100011000010110111… |
… | …1000100000101000110010 |
3 | 122201000011101100010211101 |
4 | 1020300231320200220302 |
5 | 1123410212100033020 |
6 | 14345004123035014 |
7 | 1024150300242310 |
oct | 110605570405062 |
9 | 18630141303741 |
10 | 5000111721010 |
11 | 165859879417a |
12 | 68907b36ba6a |
13 | 2a367c27ca83 |
14 | 1340145490b0 |
15 | 8a0e743e00a |
hex | 48c2de20a32 |
5000111721010 has 64 divisors (see below), whose sum is σ = 10832396590080. Its totient is φ = 1623333389760.
The previous prime is 5000111721001. The next prime is 5000111721041. The reversal of 5000111721010 is 101271110005.
It is a super-2 number, since 2×50001117210102 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1952137 + ... + 3716323.
It is an arithmetic number, because the mean of its divisors is an integer number (169256196720).
Almost surely, 25000111721010 is an apocalyptic number.
5000111721010 is an abundant number, since it is smaller than the sum of its proper divisors (5832284869070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5000111721010 is a wasteful number, since it uses less digits than its factorization.
5000111721010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1766351.
The product of its (nonzero) digits is 70, while the sum is 19.
Adding to 5000111721010 its reverse (101271110005), we get a palindrome (5101382831015).
The spelling of 5000111721010 in words is "five trillion, one hundred eleven million, seven hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •