Base | Representation |
---|---|
bin | 1010000000111110111110… |
… | …1010010000010101010101 |
3 | 1102222201221202012010101021 |
4 | 2200033233222100111111 |
5 | 2420410110113324341 |
6 | 35230504133001141 |
7 | 2214410112453610 |
oct | 240175752202525 |
9 | 42881852163337 |
10 | 11012022011221 |
11 | 3566199384980 |
12 | 129a253a831b1 |
13 | 61b576cc456a |
14 | 2a0db0083177 |
15 | 1416abd269d1 |
hex | a03efa90555 |
11012022011221 has 16 divisors (see below), whose sum is σ = 14172154011648. Its totient is φ = 8303996487600.
The previous prime is 11012022011219. The next prime is 11012022011251. The reversal of 11012022011221 is 12211022021011.
It is not a de Polignac number, because 11012022011221 - 21 = 11012022011219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11012022011195 and 11012022011204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012022011251) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2306663305 + ... + 2306668078.
It is an arithmetic number, because the mean of its divisors is an integer number (885759625728).
Almost surely, 211012022011221 is an apocalyptic number.
11012022011221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11012022011221 is a deficient number, since it is larger than the sum of its proper divisors (3160132000427).
11012022011221 is a wasteful number, since it uses less digits than its factorization.
11012022011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4613331432.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11012022011221 its reverse (12211022021011), we get a palindrome (23223044032232).
The spelling of 11012022011221 in words is "eleven trillion, twelve billion, twenty-two million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •