Base | Representation |
---|---|
bin | 1001001001010011110111… |
… | …01000111010010011011010 |
3 | 2122012121021220210101121211 |
4 | 10210221323220322103122 |
5 | 10114000023431431020 |
6 | 110434530020453334 |
7 | 4143660040452223 |
oct | 444517350722332 |
9 | 78177256711554 |
10 | 20111111202010 |
11 | 645408aa83714 |
12 | 230980254a24a |
13 | b2b614a8430a |
14 | 4d7550c5824a |
15 | 24d2097c885a |
hex | 124a7ba3a4da |
20111111202010 has 8 divisors (see below), whose sum is σ = 36200000163636. Its totient is φ = 8044444480800.
The previous prime is 20111111201989. The next prime is 20111111202019. The reversal of 20111111202010 is 1020211111102.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 20105188822161 + 5922379849 = 4483881^2 + 76957^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×201111112020102 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20111111202019) by changing a digit.
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, 1005555560091 + ... + 1005555560110.
Almost surely, 220111111202010 is an apocalyptic number.
20111111202010 is a deficient number, since it is larger than the sum of its proper divisors (16088888961626).
20111111202010 is a wasteful number, since it uses less digits than its factorization.
20111111202010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2011111120208.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20111111202010 its reverse (1020211111102), we get a palindrome (21131322313112).
The spelling of 20111111202010 in words is "twenty trillion, one hundred eleven billion, one hundred eleven million, two hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •