Base | Representation |
---|---|
bin | 1001000110011001011011… |
… | …10011011110010010110100 |
3 | 2121212000221110121101221111 |
4 | 10203030231303132102310 |
5 | 10110330032400201322 |
6 | 110320534114324404 |
7 | 4133514520565242 |
oct | 443145563362264 |
9 | 77760843541844 |
10 | 20011021100212 |
11 | 64156987a781a |
12 | 22b232a589704 |
13 | b220536b84cc |
14 | 4d2777c61792 |
15 | 24a7ec6e2177 |
hex | 12332dcde4b4 |
20011021100212 has 12 divisors (see below), whose sum is σ = 35020367627616. Its totient is φ = 10005201778040.
The previous prime is 20011021100197. The next prime is 20011021100227. The reversal of 20011021100212 is 21200112011002.
It is an interprime number because it is at equal distance from previous prime (20011021100197) and next prime (20011021100227).
It is a junction number, because it is equal to n+sod(n) for n = 20011021100192 and 20011021100201.
It is a congruent number.
It is an unprimeable number.
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, 77047168 + ... + 77306455.
It is an arithmetic number, because the mean of its divisors is an integer number (2918363968968).
Almost surely, 220011021100212 is an apocalyptic number.
It is an amenable number.
20011021100212 is a deficient number, since it is larger than the sum of its proper divisors (15009346527404).
20011021100212 is a wasteful number, since it uses less digits than its factorization.
20011021100212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154386038 (or 154386036 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20011021100212 its reverse (21200112011002), we get a palindrome (41211133111214).
The spelling of 20011021100212 in words is "twenty trillion, eleven billion, twenty-one million, one hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •