Base | Representation |
---|---|
bin | 111101001001001000… |
… | …1100101001010110111 |
3 | 110112220201221122021221 |
4 | 1322102101211022313 |
5 | 4122402043213421 |
6 | 140153025051211 |
7 | 12325545641650 |
oct | 1722221451267 |
9 | 415821848257 |
10 | 131303101111 |
11 | 5075a1a52a6 |
12 | 21545186b07 |
13 | c4c6b57190 |
14 | 64d8596527 |
15 | 3637467841 |
hex | 1e924652b7 |
131303101111 has 32 divisors (see below), whose sum is σ = 163021824000. Its totient is φ = 102979555200.
The previous prime is 131303101009. The next prime is 131303101121. The reversal of 131303101111 is 111101303131.
It is a cyclic number.
It is not a de Polignac number, because 131303101111 - 215 = 131303068343 is a prime.
It is a super-2 number, since 2×1313031011112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131303101121) 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 31 ways as a sum of consecutive naturals, for example, 6571965 + ... + 6591913.
It is an arithmetic number, because the mean of its divisors is an integer number (5094432000).
Almost surely, 2131303101111 is an apocalyptic number.
131303101111 is a deficient number, since it is larger than the sum of its proper divisors (31718722889).
131303101111 is a wasteful number, since it uses less digits than its factorization.
131303101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20599.
The product of its (nonzero) digits is 27, while the sum is 16.
Adding to 131303101111 its reverse (111101303131), we get a palindrome (242404404242).
The spelling of 131303101111 in words is "one hundred thirty-one billion, three hundred three million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •