Base | Representation |
---|---|
bin | 1010000000111100010010… |
… | …1111110010110110001110 |
3 | 1102222200002120102221200102 |
4 | 2200033010233302312032 |
5 | 2420402121310334042 |
6 | 35230304453331102 |
7 | 2214353221025141 |
oct | 240170457626616 |
9 | 42880076387612 |
10 | 11011302043022 |
11 | 3565959a37136 |
12 | 129a092936a92 |
13 | 61b490ab3388 |
14 | 2a0d425cc058 |
15 | 141668a0cb32 |
hex | a03c4bf2d8e |
11011302043022 has 8 divisors (see below), whose sum is σ = 16743212695776. Its totient is φ = 5430231144432.
The previous prime is 11011302043009. The next prime is 11011302043037. The reversal of 11011302043022 is 22034020311011.
11011302043022 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 super-2 number, since 2×110113020430222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11011302042985 and 11011302043003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 37709938358 + ... + 37709938649.
It is an arithmetic number, because the mean of its divisors is an integer number (2092901586972).
Almost surely, 211011302043022 is an apocalyptic number.
11011302043022 is a deficient number, since it is larger than the sum of its proper divisors (5731910652754).
11011302043022 is an equidigital number, since it uses as much as digits as its factorization.
11011302043022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 75419877082.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 11011302043022 its reverse (22034020311011), we get a palindrome (33045322354033).
The spelling of 11011302043022 in words is "eleven trillion, eleven billion, three hundred two million, forty-three thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •