Base | Representation |
---|---|
bin | 1010001101001001100011… |
… | …1110100011001011101110 |
3 | 1110201201102020212110001022 |
4 | 2203102120332203023232 |
5 | 2432321122401023042 |
6 | 35510511013014142 |
7 | 2235456235502312 |
oct | 243223076431356 |
9 | 43651366773038 |
10 | 11221021111022 |
11 | 3636898981a38 |
12 | 1312861324352 |
13 | 6351a383a058 |
14 | 2ab1593c3b42 |
15 | 146d4034acd2 |
hex | a3498fa32ee |
11221021111022 has 8 divisors (see below), whose sum is σ = 17034321204936. Its totient is φ = 5542914042712.
The previous prime is 11221021110997. The next prime is 11221021111049. The reversal of 11221021111022 is 22011112012211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×112210211110222 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33798256193 + ... + 33798256524.
It is an arithmetic number, because the mean of its divisors is an integer number (2129290150617).
Almost surely, 211221021111022 is an apocalyptic number.
11221021111022 is a deficient number, since it is larger than the sum of its proper divisors (5813300093914).
11221021111022 is an equidigital number, since it uses as much as digits as its factorization.
11221021111022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67596512802.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11221021111022 its reverse (22011112012211), we get a palindrome (33232133123233).
The spelling of 11221021111022 in words is "eleven trillion, two hundred twenty-one billion, twenty-one million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •