Base | Representation |
---|---|
bin | 1010000001100100100100… |
… | …0001000111011101101101 |
3 | 1110000200222212121111110020 |
4 | 2200121021001013131231 |
5 | 2421041240421023041 |
6 | 35235253221232353 |
7 | 2215215121422003 |
oct | 240311101073555 |
9 | 43020885544406 |
10 | 11022111111021 |
11 | 356a4a641598a |
12 | 12a01aa8626b9 |
13 | 61c4c42a9cba |
14 | 2a1689d9aa73 |
15 | 141a9c934866 |
hex | a064904776d |
11022111111021 has 16 divisors (see below), whose sum is σ = 14755174539840. Its totient is φ = 7318562768000.
The previous prime is 11022111111019. The next prime is 11022111111031. The reversal of 11022111111021 is 12011111122011.
It is a cyclic number.
It is not a de Polignac number, because 11022111111021 - 21 = 11022111111019 is a prime.
It is a super-3 number, since 3×110221111110213 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11022111111031) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 24895375 + ... + 25334243.
It is an arithmetic number, because the mean of its divisors is an integer number (922198408740).
Almost surely, 211022111111021 is an apocalyptic number.
It is an amenable number.
11022111111021 is a deficient number, since it is larger than the sum of its proper divisors (3733063428819).
11022111111021 is a wasteful number, since it uses less digits than its factorization.
11022111111021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472476.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 11022111111021 its reverse (12011111122011), we get a palindrome (23033222233032).
The spelling of 11022111111021 in words is "eleven trillion, twenty-two billion, one hundred eleven million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •