Base | Representation |
---|---|
bin | 1011101101010010101… |
… | …0000111100000011101 |
3 | 201020011112110000120102 |
4 | 2323110222013200131 |
5 | 11243411343244310 |
6 | 232222321030445 |
7 | 20350226252042 |
oct | 2732452074035 |
9 | 636145400512 |
10 | 201136306205 |
11 | 7833522393a |
12 | 32b94185425 |
13 | 15c75872303 |
14 | 9a40d911c9 |
15 | 53730cc8a5 |
hex | 2ed4a8781d |
201136306205 has 8 divisors (see below), whose sum is σ = 241487291904. Its totient is φ = 160826562000.
The previous prime is 201136306177. The next prime is 201136306237. The reversal of 201136306205 is 502603631102.
201136306205 is digitally balanced in base 2, because in such base 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 not a de Polignac number, because 201136306205 - 214 = 201136289821 is a prime.
It is a Duffinian number.
It is a Curzon number.
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 7 ways as a sum of consecutive naturals, for example, 10299641 + ... + 10319150.
It is an arithmetic number, because the mean of its divisors is an integer number (30185911488).
Almost surely, 2201136306205 is an apocalyptic number.
It is an amenable number.
201136306205 is a deficient number, since it is larger than the sum of its proper divisors (40350985699).
201136306205 is a wasteful number, since it uses less digits than its factorization.
201136306205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20620747.
The product of its (nonzero) digits is 6480, while the sum is 29.
Adding to 201136306205 its reverse (502603631102), we get a palindrome (703739937307).
The spelling of 201136306205 in words is "two hundred one billion, one hundred thirty-six million, three hundred six thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •