Base | Representation |
---|---|
bin | 101101101110111111010111… |
… | …101100100011011101101100 |
3 | 222101011220200022101121212212 |
4 | 231232333113230203131230 |
5 | 202330444220422020022 |
6 | 1551443001220345552 |
7 | 60236655146164160 |
oct | 5556772754433554 |
9 | 871156608347785 |
10 | 201141232220012 |
11 | 590a9576935527 |
12 | 1a6866278452b8 |
13 | 88306c94b2476 |
14 | 37954051b4ca0 |
15 | 183c2297c93e2 |
hex | b6efd7b2376c |
201141232220012 has 48 divisors (see below), whose sum is σ = 411641338386432. Its totient is φ = 84197946026880.
The previous prime is 201141232219901. The next prime is 201141232220029. The reversal of 201141232220012 is 210022232141102.
It is a self number, because there is not a number n which added to its sum of digits gives 201141232220012.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 156932837 + ... + 158209347.
It is an arithmetic number, because the mean of its divisors is an integer number (8575861216384).
Almost surely, 2201141232220012 is an apocalyptic number.
It is an amenable number.
201141232220012 is an abundant number, since it is smaller than the sum of its proper divisors (210500106166420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201141232220012 is a wasteful number, since it uses less digits than its factorization.
201141232220012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1407438 (or 1407436 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 201141232220012 its reverse (210022232141102), we get a palindrome (411163464361114).
The spelling of 201141232220012 in words is "two hundred one trillion, one hundred forty-one billion, two hundred thirty-two million, two hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •