Base | Representation |
---|---|
bin | 11101101111110101000… |
… | …00010000111010000011 |
3 | 10121201020121022100200202 |
4 | 32313322200100322003 |
5 | 113221240130323021 |
6 | 2101314552435415 |
7 | 133562560513355 |
oct | 16677240207203 |
9 | 3551217270622 |
10 | 1022110011011 |
11 | 364524500471 |
12 | 1461126a8b6b |
13 | 754ccb57bab |
14 | 37682a630d5 |
15 | 1b8c2875a0b |
hex | edfa810e83 |
1022110011011 has 4 divisors (see below), whose sum is σ = 1022149744224. Its totient is φ = 1022070277800.
The previous prime is 1022110011001. The next prime is 1022110011019. The reversal of 1022110011011 is 1101100112201.
1022110011011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1022110011011 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1022110010983 and 1022110011001.
It is not an unprimeable number, because it can be changed into a prime (1022110011019) 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, 19827995 + ... + 19879476.
It is an arithmetic number, because the mean of its divisors is an integer number (255537436056).
Almost surely, 21022110011011 is an apocalyptic number.
1022110011011 is a deficient number, since it is larger than the sum of its proper divisors (39733213).
1022110011011 is an equidigital number, since it uses as much as digits as its factorization.
1022110011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39733212.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1022110011011 its reverse (1101100112201), we get a palindrome (2123210123212).
The spelling of 1022110011011 in words is "one trillion, twenty-two billion, one hundred ten million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •