Base | Representation |
---|---|
bin | 1011101100110100100… |
… | …1000100000110111110 |
3 | 201012211202011012210002 |
4 | 2323031021010012332 |
5 | 11243132102413042 |
6 | 232202014114302 |
7 | 20344135342331 |
oct | 2731511040676 |
9 | 635752135702 |
10 | 201010201022 |
11 | 78280022184 |
12 | 32b59aab992 |
13 | 15c556bb567 |
14 | 9a2c326618 |
15 | 5366ebd132 |
hex | 2ecd2441be |
201010201022 has 8 divisors (see below), whose sum is σ = 301553247072. Its totient is φ = 100492452000.
The previous prime is 201010200983. The next prime is 201010201027. The reversal of 201010201022 is 220102010102.
It is a happy number.
201010201022 is digitally balanced in base 2 and base 3, because in such bases 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 = 201010200994 and 201010201012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201010201027) 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, 6304379 + ... + 6336182.
It is an arithmetic number, because the mean of its divisors is an integer number (37694155884).
Almost surely, 2201010201022 is an apocalyptic number.
201010201022 is a deficient number, since it is larger than the sum of its proper divisors (100543046050).
201010201022 is a wasteful number, since it uses less digits than its factorization.
201010201022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12648514.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 201010201022 its reverse (220102010102), we get a palindrome (421112211124).
The spelling of 201010201022 in words is "two hundred one billion, ten million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •