Base | Representation |
---|---|
bin | 1001001001010100101011… |
… | …10011000010110110110110 |
3 | 2122012122102111120222222110 |
4 | 10210222111303002312312 |
5 | 10114001423304103402 |
6 | 110435041335111450 |
7 | 4144003646651325 |
oct | 444522563026666 |
9 | 78178374528873 |
10 | 20111550066102 |
11 | 6454295783810 |
12 | 2309905512586 |
13 | b2b684982401 |
14 | 4d75932580bc |
15 | 24d2330b756c |
hex | 124a95cc2db6 |
20111550066102 has 32 divisors (see below), whose sum is σ = 46189205896320. Its totient is φ = 5773650736320.
The previous prime is 20111550066073. The next prime is 20111550066133. The reversal of 20111550066102 is 20166005511102.
It is a super-2 number, since 2×201115500661022 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20111550066102.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8018958103 + ... + 8018960610.
It is an arithmetic number, because the mean of its divisors is an integer number (1443412684260).
Almost surely, 220111550066102 is an apocalyptic number.
20111550066102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20111550066102 is an abundant number, since it is smaller than the sum of its proper divisors (26077655830218).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20111550066102 is a wasteful number, since it uses less digits than its factorization.
20111550066102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16037918748.
The product of its (nonzero) digits is 3600, while the sum is 30.
Adding to 20111550066102 its reverse (20166005511102), we get a palindrome (40277555577204).
The spelling of 20111550066102 in words is "twenty trillion, one hundred eleven billion, five hundred fifty million, sixty-six thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •