Base | Representation |
---|---|
bin | 101101101110110101000010… |
… | …000001111110110100100111 |
3 | 222101010212000200002110222210 |
4 | 231232311002001332310213 |
5 | 202330304002104220403 |
6 | 1551433523505454503 |
7 | 60236113103120406 |
oct | 5556650201766447 |
9 | 871125020073883 |
10 | 201130131320103 |
11 | 590a489a751087 |
12 | 1a68444a041433 |
13 | 882c64a6ba83b |
14 | 3794a70b5b63d |
15 | 183bcc9e58b03 |
hex | b6ed4207ed27 |
201130131320103 has 16 divisors (see below), whose sum is σ = 278505774816896. Its totient is φ = 129013704499680.
The previous prime is 201130131320099. The next prime is 201130131320137. The reversal of 201130131320103 is 301023131031102.
It is a happy number.
It is not a de Polignac number, because 201130131320103 - 22 = 201130131320099 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 201130131320103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201130131320303) 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, 11635426468 + ... + 11635443753.
It is an arithmetic number, because the mean of its divisors is an integer number (17406610926056).
Almost surely, 2201130131320103 is an apocalyptic number.
201130131320103 is a deficient number, since it is larger than the sum of its proper divisors (77375643496793).
201130131320103 is a wasteful number, since it uses less digits than its factorization.
201130131320103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23270870334.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 201130131320103 its reverse (301023131031102), we get a palindrome (502153262351205).
The spelling of 201130131320103 in words is "two hundred one trillion, one hundred thirty billion, one hundred thirty-one million, three hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.133 sec. • engine limits •