Base | Representation |
---|---|
bin | 101101101110100011011001… |
… | …101100101000000000111100 |
3 | 222101002001011101101200220021 |
4 | 231232203121230220000330 |
5 | 202330001214430201022 |
6 | 1551421113231501524 |
7 | 60234543020210101 |
oct | 5556433154500074 |
9 | 871061141350807 |
10 | 201111201022012 |
11 | 59097866022a26 |
12 | 1a6808463878a4 |
13 | 882a921816018 |
14 | 3793b96968aa8 |
15 | 183b56d08b7c7 |
hex | b6e8d9b2803c |
201111201022012 has 12 divisors (see below), whose sum is σ = 351944702056080. Its totient is φ = 100555571863136.
The previous prime is 201111201021961. The next prime is 201111201022013. The reversal of 201111201022012 is 210220102111102.
It is a super-2 number, since 2×2011112010220122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201111201022013) 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, 20531064 + ... + 28700992.
It is an arithmetic number, because the mean of its divisors is an integer number (29328725171340).
Almost surely, 2201111201022012 is an apocalyptic number.
It is an amenable number.
201111201022012 is a deficient number, since it is larger than the sum of its proper divisors (150833501034068).
201111201022012 is a wasteful number, since it uses less digits than its factorization.
201111201022012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14323940 (or 14323938 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201111201022012 its reverse (210220102111102), we get a palindrome (411331303133114).
The spelling of 201111201022012 in words is "two hundred one trillion, one hundred eleven billion, two hundred one million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •