Base | Representation |
---|---|
bin | 1001001100100010110010… |
… | …1001001111000110000110 |
3 | 1022210121112002021202012220 |
4 | 2103020230221033012012 |
5 | 2311130014104201042 |
6 | 33300550502553210 |
7 | 2062334351062041 |
oct | 223105451170606 |
9 | 38717462252186 |
10 | 10111102022022 |
11 | 324910454a631 |
12 | 1173723738806 |
13 | 58461ba63561 |
14 | 26d546819c58 |
15 | 12802db708ec |
hex | 9322ca4f186 |
10111102022022 has 8 divisors (see below), whose sum is σ = 20222204044056. Its totient is φ = 3370367340672.
The previous prime is 10111102022011. The next prime is 10111102022107. The reversal of 10111102022022 is 22022020111101.
It is a sphenic number, since it is the product of 3 distinct primes.
10111102022022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 10111102021992 and 10111102022010.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 842591835163 + ... + 842591835174.
It is an arithmetic number, because the mean of its divisors is an integer number (2527775505507).
Almost surely, 210111102022022 is an apocalyptic number.
10111102022022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111102022022 is a wasteful number, since it uses less digits than its factorization.
10111102022022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1685183670342.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 10111102022022 its reverse (22022020111101), we get a palindrome (32133122133123).
The spelling of 10111102022022 in words is "ten trillion, one hundred eleven billion, one hundred two million, twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •