Base | Representation |
---|---|
bin | 101101111011101001011010… |
… | …000001101110010000011000 |
3 | 222111021001201002001122010120 |
4 | 231323221122001232100120 |
5 | 202434222013030413422 |
6 | 1553350323453513240 |
7 | 60356545645063626 |
oct | 5573513201562030 |
9 | 874231632048116 |
10 | 202011002201112 |
11 | 59404426365725 |
12 | 1a7a7103aa2820 |
13 | 889472c03b710 |
14 | 37c5555798516 |
15 | 1854b82de345c |
hex | b7ba5a06e418 |
202011002201112 has 64 divisors (see below), whose sum is σ = 546271703873280. Its totient is φ = 61883411021952.
The previous prime is 202011002201069. The next prime is 202011002201123. The reversal of 202011002201112 is 211102200110202.
It is a junction number, because it is equal to n+sod(n) for n = 202011002201091 and 202011002201100.
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 15 ways as a sum of consecutive naturals, for example, 1426077108 + ... + 1426218755.
It is an arithmetic number, because the mean of its divisors is an integer number (8535495373020).
Almost surely, 2202011002201112 is an apocalyptic number.
It is an amenable number.
202011002201112 is an abundant number, since it is smaller than the sum of its proper divisors (344260701672168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202011002201112 is a wasteful number, since it uses less digits than its factorization.
202011002201112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2852296112 (or 2852296108 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 202011002201112 its reverse (211102200110202), we get a palindrome (413113202311314).
The spelling of 202011002201112 in words is "two hundred two trillion, eleven billion, two million, two hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •