Base | Representation |
---|---|
bin | 1001001001010100000010… |
… | …00011010100011111110001 |
3 | 2122012121112020122222022020 |
4 | 10210222001003110133301 |
5 | 10114000220203323441 |
6 | 110434543023102053 |
7 | 4143662222354634 |
oct | 444520103243761 |
9 | 78177466588266 |
10 | 20111202011121 |
11 | 6454127267971 |
12 | 2309828a41929 |
13 | b2b62a82a610 |
14 | 4d755cd35c1b |
15 | 24d212764e66 |
hex | 124a810d47f1 |
20111202011121 has 32 divisors (see below), whose sum is σ = 29191049543040. Its totient is φ = 12242176704000.
The previous prime is 20111202011083. The next prime is 20111202011141. The reversal of 20111202011121 is 12111020211102.
It is a happy number.
It is not a de Polignac number, because 20111202011121 - 213 = 20111202002929 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20111202011121.
It is not an unprimeable number, because it can be changed into a prime (20111202011141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1381035 + ... + 6490736.
It is an arithmetic number, because the mean of its divisors is an integer number (912220298220).
Almost surely, 220111202011121 is an apocalyptic number.
It is an amenable number.
20111202011121 is a deficient number, since it is larger than the sum of its proper divisors (9079847531919).
20111202011121 is a wasteful number, since it uses less digits than its factorization.
20111202011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7872497.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 20111202011121 its reverse (12111020211102), we get a palindrome (32222222222223).
The spelling of 20111202011121 in words is "twenty trillion, one hundred eleven billion, two hundred two million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •