Base | Representation |
---|---|
bin | 1011101101100010010… |
… | …1000110011101010010 |
3 | 201020100010020200202111 |
4 | 2323120211012131102 |
5 | 11244030214200200 |
6 | 232233031135534 |
7 | 20351655426610 |
oct | 2733045063522 |
9 | 636303220674 |
10 | 201202100050 |
11 | 78369381816 |
12 | 32bb22145aa |
13 | 15c8639a493 |
14 | 9a499da6b0 |
15 | 5378c770ba |
hex | 2ed8946752 |
201202100050 has 192 divisors, whose sum is σ = 469364958720. Its totient is φ = 62567608320.
The previous prime is 201202100003. The next prime is 201202100051. The reversal of 201202100050 is 50001202102.
201202100050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 201202100050.
It is not an unprimeable number, because it can be changed into a prime (201202100051) 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 95 ways as a sum of consecutive naturals, for example, 147184467 + ... + 147185833.
It is an arithmetic number, because the mean of its divisors is an integer number (2444609160).
Almost surely, 2201202100050 is an apocalyptic number.
201202100050 is an abundant number, since it is smaller than the sum of its proper divisors (268162858670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201202100050 is a wasteful number, since it uses less digits than its factorization.
201202100050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2285 (or 2280 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 13.
Adding to 201202100050 its reverse (50001202102), we get a palindrome (251203302152).
The spelling of 201202100050 in words is "two hundred one billion, two hundred two million, one hundred thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •