Base | Representation |
---|---|
bin | 1010000010000010101111… |
… | …0011110100010011110110 |
3 | 1110001110220101000111201220 |
4 | 2200200223303310103312 |
5 | 2421204333010120042 |
6 | 35243113050331210 |
7 | 2215622624465025 |
oct | 240405363642366 |
9 | 43043811014656 |
10 | 11030211020022 |
11 | 3572982622457 |
12 | 12a188b429b06 |
13 | 6201b543136c |
14 | 2a1c17a308bc |
15 | 141dc3ab78ec |
hex | a082bcf44f6 |
11030211020022 has 8 divisors (see below), whose sum is σ = 22060422040056. Its totient is φ = 3676737006672.
The previous prime is 11030211019897. The next prime is 11030211020029. The reversal of 11030211020022 is 22002011203011.
It is a sphenic number, since it is the product of 3 distinct primes.
11030211020022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 11030211019983 and 11030211020010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11030211020029) 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, 919184251663 + ... + 919184251674.
It is an arithmetic number, because the mean of its divisors is an integer number (2757552755007).
Almost surely, 211030211020022 is an apocalyptic number.
11030211020022 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.
11030211020022 is a wasteful number, since it uses less digits than its factorization.
11030211020022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1838368503342.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 11030211020022 its reverse (22002011203011), we get a palindrome (33032222223033).
The spelling of 11030211020022 in words is "eleven trillion, thirty billion, two hundred eleven million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •