Base | Representation |
---|---|
bin | 101101101110110101000010… |
… | …000001111010011011100001 |
3 | 222101010212000200001120022111 |
4 | 231232311002001322123201 |
5 | 202330304002103131423 |
6 | 1551433523505235321 |
7 | 60236113103014066 |
oct | 5556650201723341 |
9 | 871125020046274 |
10 | 201130131302113 |
11 | 590a489a739612 |
12 | 1a68444a032b41 |
13 | 882c64a6b25b0 |
14 | 3794a70b54c6d |
15 | 183bcc9e5360d |
hex | b6ed4207a6e1 |
201130131302113 has 16 divisors (see below), whose sum is σ = 220504031879040. Its totient is φ = 182320313503104.
The previous prime is 201130131302101. The next prime is 201130131302123. The reversal of 201130131302113 is 311203131031102.
201130131302113 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 201130131302113 - 217 = 201130131171041 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201130131302123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 136850181 + ... + 138312082.
It is an arithmetic number, because the mean of its divisors is an integer number (13781501992440).
Almost surely, 2201130131302113 is an apocalyptic number.
It is an amenable number.
201130131302113 is a deficient number, since it is larger than the sum of its proper divisors (19373900576927).
201130131302113 is a wasteful number, since it uses less digits than its factorization.
201130131302113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 275163288.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 201130131302113 its reverse (311203131031102), we get a palindrome (512333262333215).
The spelling of 201130131302113 in words is "two hundred one trillion, one hundred thirty billion, one hundred thirty-one million, three hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •