Base | Representation |
---|---|
bin | 1010001100101000010111… |
… | …1001001111111111110110 |
3 | 1110200212102021221220222221 |
4 | 2203022011321033333312 |
5 | 2432144400410120042 |
6 | 35502434522512554 |
7 | 2235022364124523 |
oct | 243120571177766 |
9 | 43625367856887 |
10 | 11212111020022 |
11 | 363303640a770 |
12 | 1310b9536575a |
13 | 6343b38a9463 |
14 | 2aa951cd414a |
15 | 1469bcecdd67 |
hex | a3285e4fff6 |
11212111020022 has 8 divisors (see below), whose sum is σ = 18347090760072. Its totient is φ = 5096414100000.
The previous prime is 11212111020013. The next prime is 11212111020031. The reversal of 11212111020022 is 22002011121211.
It is an interprime number because it is at equal distance from previous prime (11212111020013) and next prime (11212111020031).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×112121110200222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11212111019978 and 11212111020005.
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, 254820704979 + ... + 254820705022.
It is an arithmetic number, because the mean of its divisors is an integer number (2293386345009).
Almost surely, 211212111020022 is an apocalyptic number.
11212111020022 is a deficient number, since it is larger than the sum of its proper divisors (7134979740050).
11212111020022 is a wasteful number, since it uses less digits than its factorization.
11212111020022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 509641410014.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11212111020022 its reverse (22002011121211), we get a palindrome (33214122141233).
The spelling of 11212111020022 in words is "eleven trillion, two hundred twelve billion, one hundred eleven million, twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •