Base | Representation |
---|---|
bin | 1011101101010000100… |
… | …0110011000010110111 |
3 | 201020010221000020222222 |
4 | 2323110020303002313 |
5 | 11243402124243024 |
6 | 232221405512555 |
7 | 20350062102611 |
oct | 2732410630267 |
9 | 636127006888 |
10 | 201127571639 |
11 | 783302a8495 |
12 | 32b9127275b |
13 | 15c73b04727 |
14 | 9a3db59db1 |
15 | 537245485e |
hex | 2ed42330b7 |
201127571639 has 16 divisors (see below), whose sum is σ = 202781180160. Its totient is φ = 199482648960.
The previous prime is 201127571627. The next prime is 201127571647. The reversal of 201127571639 is 936175721102.
201127571639 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 201127571639 - 232 = 196832604343 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201127571639.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201127571609) 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 15 ways as a sum of consecutive naturals, for example, 85987532 + ... + 85989870.
It is an arithmetic number, because the mean of its divisors is an integer number (12673823760).
Almost surely, 2201127571639 is an apocalyptic number.
201127571639 is a deficient number, since it is larger than the sum of its proper divisors (1653608521).
201127571639 is a wasteful number, since it uses less digits than its factorization.
201127571639 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3910.
The product of its (nonzero) digits is 158760, while the sum is 44.
The spelling of 201127571639 in words is "two hundred one billion, one hundred twenty-seven million, five hundred seventy-one thousand, six hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •