Base | Representation |
---|---|
bin | 1001001100100010110100… |
… | …1111011000000011111110 |
3 | 1022210121112210002201011121 |
4 | 2103020231033120003332 |
5 | 2311130024134121342 |
6 | 33300551501141154 |
7 | 2062334532053233 |
oct | 223105517300376 |
9 | 38717483081147 |
10 | 10111112020222 |
11 | 324910a159404 |
12 | 1173726b5a7ba |
13 | 584620b54355 |
14 | 26d547c9d78a |
15 | 12802e998067 |
hex | 9322d3d80fe |
10111112020222 has 8 divisors (see below), whose sum is σ = 15964913716200. Its totient is φ = 4789474114824.
The previous prime is 10111112020211. The next prime is 10111112020223. The reversal of 10111112020222 is 22202021111101.
10111112020222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10111112020196 and 10111112020205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111112020223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 133040947597 + ... + 133040947672.
It is an arithmetic number, because the mean of its divisors is an integer number (1995614214525).
Almost surely, 210111112020222 is an apocalyptic number.
10111112020222 is a deficient number, since it is larger than the sum of its proper divisors (5853801695978).
10111112020222 is a wasteful number, since it uses less digits than its factorization.
10111112020222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 266081895290.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10111112020222 its reverse (22202021111101), we get a palindrome (32313133131323).
The spelling of 10111112020222 in words is "ten trillion, one hundred eleven billion, one hundred twelve million, twenty thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •