Base | Representation |
---|---|
bin | 1011101100110010101… |
… | …0100010110010011100 |
3 | 201012211012002201202002 |
4 | 2323030222202302130 |
5 | 11243123030401340 |
6 | 232201130421432 |
7 | 20344010340353 |
oct | 2731452426234 |
9 | 635735081662 |
10 | 201002200220 |
11 | 78276558048 |
12 | 32b57291878 |
13 | 15c53b49963 |
14 | 9a2b24299a |
15 | 536643c715 |
hex | 2eccaa2c9c |
201002200220 has 12 divisors (see below), whose sum is σ = 422104620504. Its totient is φ = 80400880080.
The previous prime is 201002200219. The next prime is 201002200241. The reversal of 201002200220 is 22002200102.
201002200220 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
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, 5025054986 + ... + 5025055025.
It is an arithmetic number, because the mean of its divisors is an integer number (35175385042).
Almost surely, 2201002200220 is an apocalyptic number.
201002200220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201002200220 is an abundant number, since it is smaller than the sum of its proper divisors (221102420284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201002200220 is a wasteful number, since it uses less digits than its factorization.
201002200220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10050110020 (or 10050110018 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 11.
Adding to 201002200220 its reverse (22002200102), we get a palindrome (223004400322).
The spelling of 201002200220 in words is "two hundred one billion, two million, two hundred thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •