Base | Representation |
---|---|
bin | 1011101101001100101… |
… | …0010110001010011100 |
3 | 201020002210012111220020 |
4 | 2323103022112022130 |
5 | 11243333431403122 |
6 | 232220022552140 |
7 | 20346502666233 |
oct | 2732312261234 |
9 | 636083174806 |
10 | 201111200412 |
11 | 78322036551 |
12 | 32b87898650 |
13 | 15c705c1c05 |
14 | 9a3b8d7b1a |
15 | 5370cbdc5c |
hex | 2ed329629c |
201111200412 has 24 divisors (see below), whose sum is σ = 470156727936. Its totient is φ = 66908886768.
The previous prime is 201111200377. The next prime is 201111200441. The reversal of 201111200412 is 214002111102.
201111200412 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 201111200391 and 201111200400.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 16015968 + ... + 16028519.
It is an arithmetic number, because the mean of its divisors is an integer number (19589863664).
Almost surely, 2201111200412 is an apocalyptic number.
It is an amenable number.
201111200412 is an abundant number, since it is smaller than the sum of its proper divisors (269045527524).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201111200412 is a wasteful number, since it uses less digits than its factorization.
201111200412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32045017 (or 32045015 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201111200412 its reverse (214002111102), we get a palindrome (415113311514).
The spelling of 201111200412 in words is "two hundred one billion, one hundred eleven million, two hundred thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •