Base | Representation |
---|---|
bin | 1011101100110100110… |
… | …0100000000111111010 |
3 | 201012211210211222222010 |
4 | 2323031030200013322 |
5 | 11243132320232302 |
6 | 232202045310350 |
7 | 20344146114561 |
oct | 2731514400772 |
9 | 635753758863 |
10 | 201011102202 |
11 | 78280588259 |
12 | 32b5a2653b6 |
13 | 15c559457c1 |
14 | 9a2c4bcbd8 |
15 | 53670ea16c |
hex | 2ecd3201fa |
201011102202 has 8 divisors (see below), whose sum is σ = 402022204416. Its totient is φ = 67003700732.
The previous prime is 201011102189. The next prime is 201011102207. The reversal of 201011102202 is 202201110102.
201011102202 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
201011102202 is an admirable number.
It is not an unprimeable number, because it can be changed into a prime (201011102207) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 16750925178 + ... + 16750925189.
It is an arithmetic number, because the mean of its divisors is an integer number (50252775552).
Almost surely, 2201011102202 is an apocalyptic number.
201011102202 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201011102202 is a wasteful number, since it uses less digits than its factorization.
201011102202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33501850372.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 201011102202 its reverse (202201110102), we get a palindrome (403212212304).
The spelling of 201011102202 in words is "two hundred one billion, eleven million, one hundred two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •