Base | Representation |
---|---|
bin | 1011101100110100110… |
… | …0111000000000010110 |
3 | 201012211211000222011002 |
4 | 2323031030320000112 |
5 | 11243132331400042 |
6 | 232202051343302 |
7 | 20344150003013 |
oct | 2731514700026 |
9 | 635754028132 |
10 | 201011200022 |
11 | 782806447a6 |
12 | 32b5a2b1b32 |
13 | 15c5597b199 |
14 | 9a2c50670a |
15 | 5367119132 |
hex | 2ecd338016 |
201011200022 has 8 divisors (see below), whose sum is σ = 304334714376. Its totient is φ = 99566295232.
The previous prime is 201011200007. The next prime is 201011200031. The reversal of 201011200022 is 220002110102.
It is a happy number.
201011200022 is digitally balanced in base 3, 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.
It is a junction number, because it is equal to n+sod(n) for n = 201011199976 and 201011200012.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 469652123 + ... + 469652550.
It is an arithmetic number, because the mean of its divisors is an integer number (38041839297).
Almost surely, 2201011200022 is an apocalyptic number.
201011200022 is a deficient number, since it is larger than the sum of its proper divisors (103323514354).
201011200022 is a wasteful number, since it uses less digits than its factorization.
201011200022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 939304782.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 201011200022 its reverse (220002110102), we get a palindrome (421013310124).
The spelling of 201011200022 in words is "two hundred one billion, eleven million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •