Base | Representation |
---|---|
bin | 1001001001000011000111… |
… | …10010011110100110100011 |
3 | 2122011202002101101000120100 |
4 | 10210201203302132212203 |
5 | 10113323121001402321 |
6 | 110430441552113443 |
7 | 4143221205156102 |
oct | 444414362364643 |
9 | 78152071330510 |
10 | 20102121122211 |
11 | 64502973486a7 |
12 | 2307b13835883 |
13 | b2a81139847b |
14 | 4d6d3aca6039 |
15 | 24cd8040b326 |
hex | 124863c9e9a3 |
20102121122211 has 12 divisors (see below), whose sum is σ = 29152080037080. Its totient is φ = 13348021992000.
The previous prime is 20102121122197. The next prime is 20102121122249. The reversal of 20102121122211 is 11222112120102.
20102121122211 is a `hidden beast` number, since 201 + 0 + 21 + 211 + 22 + 211 = 666.
It is not a de Polignac number, because 20102121122211 - 215 = 20102121089443 is a prime.
It is a super-2 number, since 2×201021211222112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20102121122711) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4449338406 + ... + 4449342923.
It is an arithmetic number, because the mean of its divisors is an integer number (2429340003090).
Almost surely, 220102121122211 is an apocalyptic number.
20102121122211 is a deficient number, since it is larger than the sum of its proper divisors (9049958914869).
20102121122211 is a wasteful number, since it uses less digits than its factorization.
20102121122211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8898681586 (or 8898681583 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 20102121122211 its reverse (11222112120102), we get a palindrome (31324233242313).
The spelling of 20102121122211 in words is "twenty trillion, one hundred two billion, one hundred twenty-one million, one hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •