Base | Representation |
---|---|
bin | 11101110010011101100111… |
… | …110111011011001000101011 |
3 | 122011212112121220111220201001 |
4 | 131302131213313123020223 |
5 | 114132441243240342303 |
6 | 1142345403211135431 |
7 | 36411145635044620 |
oct | 3562354767331053 |
9 | 564775556456631 |
10 | 131011130012203 |
11 | 38820565491011 |
12 | 1283aa02444577 |
13 | 58143b169955c |
14 | 244cd8887a347 |
15 | 1022d77ed131d |
hex | 772767ddb22b |
131011130012203 has 8 divisors (see below), whose sum is σ = 152181546806240. Its totient is φ = 110454348487680.
The previous prime is 131011130012179. The next prime is 131011130012221. The reversal of 131011130012203 is 302210031110131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131011130012203 - 29 = 131011130011691 is a prime.
It is not an unprimeable number, because it can be changed into a prime (131011130012803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 153408816918 + ... + 153408817771.
It is an arithmetic number, because the mean of its divisors is an integer number (19022693350780).
Almost surely, 2131011130012203 is an apocalyptic number.
131011130012203 is a deficient number, since it is larger than the sum of its proper divisors (21170416794037).
131011130012203 is an equidigital number, since it uses as much as digits as its factorization.
131011130012203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306817634757.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 131011130012203 its reverse (302210031110131), we get a palindrome (433221161122334).
The spelling of 131011130012203 in words is "one hundred thirty-one trillion, eleven billion, one hundred thirty million, twelve thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •