Base | Representation |
---|---|
bin | 1011101100111100001… |
… | …0011100101101010000 |
3 | 201012220222000211212012 |
4 | 2323033002130231100 |
5 | 11243213224134300 |
6 | 232205112122052 |
7 | 20345002661456 |
oct | 2731702345520 |
9 | 635828024765 |
10 | 201042021200 |
11 | 78296a86149 |
12 | 32b68696328 |
13 | 15c5c17cb77 |
14 | 9a3264a9d6 |
15 | 5369ba6435 |
hex | 2ecf09cb50 |
201042021200 has 60 divisors (see below), whose sum is σ = 483931027548. Its totient is φ = 80262374400.
The previous prime is 201042021151. The next prime is 201042021227. The reversal of 201042021200 is 2120240102.
201042021200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 42006961936 + 159035059264 = 204956^2 + 398792^2 .
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 11 ways as a sum of consecutive naturals, for example, 273947 + ... + 690746.
Almost surely, 2201042021200 is an apocalyptic number.
201042021200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
201042021200 is an abundant number, since it is smaller than the sum of its proper divisors (282889006348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201042021200 is a wasteful number, since it uses less digits than its factorization.
201042021200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 965232 (or 965221 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 201042021200 its reverse (2120240102), we get a palindrome (203162261302).
The spelling of 201042021200 in words is "two hundred one billion, forty-two million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •