Base | Representation |
---|---|
bin | 1011101101010001101… |
… | …0001001111110100110 |
3 | 201020011020120102221200 |
4 | 2323110122021332212 |
5 | 11243404310401042 |
6 | 232222051223330 |
7 | 20350145554206 |
oct | 2732432117646 |
9 | 636136512850 |
10 | 201132122022 |
11 | 78332926237 |
12 | 32b928a7b46 |
13 | 15c74a38970 |
14 | 9a405c2406 |
15 | 5372a52c4c |
hex | 2ed4689fa6 |
201132122022 has 48 divisors (see below), whose sum is σ = 477001897008. Its totient is φ = 60872264640.
The previous prime is 201132122017. The next prime is 201132122027. The reversal of 201132122022 is 220221231102.
It is an interprime number because it is at equal distance from previous prime (201132122017) and next prime (201132122027).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 201132121986 and 201132122004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201132122027) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7031128 + ... + 7059675.
It is an arithmetic number, because the mean of its divisors is an integer number (9937539521).
Almost surely, 2201132122022 is an apocalyptic number.
201132122022 is an abundant number, since it is smaller than the sum of its proper divisors (275869774986).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201132122022 is a wasteful number, since it uses less digits than its factorization.
201132122022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14090885 (or 14090882 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 201132122022 its reverse (220221231102), we get a palindrome (421353353124).
The spelling of 201132122022 in words is "two hundred one billion, one hundred thirty-two million, one hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •