Base | Representation |
---|---|
bin | 1001001100100010110100… |
… | …1011111010000101101110 |
3 | 1022210121112201101111222112 |
4 | 2103020231023322011232 |
5 | 2311130023421023042 |
6 | 33300551425444022 |
7 | 2062334521245425 |
oct | 223105513720556 |
9 | 38717481344875 |
10 | 10111111111022 |
11 | 32491096982a9 |
12 | 11737267a0612 |
13 | 5846208c656c |
14 | 26d547b042bc |
15 | 12802e868982 |
hex | 9322d2fa16e |
10111111111022 has 8 divisors (see below), whose sum is σ = 15169760025456. Its totient is φ = 5054524435872.
The previous prime is 10111111111021. The next prime is 10111111111037. The reversal of 10111111111022 is 22011111111101.
10111111111022 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 = 10111111110988 and 10111111111006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10111111111021) 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, 515547563 + ... + 515567174.
It is an arithmetic number, because the mean of its divisors is an integer number (1896220003182).
Almost surely, 210111111111022 is an apocalyptic number.
10111111111022 is a deficient number, since it is larger than the sum of its proper divisors (5058648914434).
10111111111022 is a wasteful number, since it uses less digits than its factorization.
10111111111022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1031119642.
The product of its (nonzero) digits is 4, while the sum is 14.
Adding to 10111111111022 its reverse (22011111111101), we get a palindrome (32122222222123).
The spelling of 10111111111022 in words is "ten trillion, one hundred eleven billion, one hundred eleven million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •