Base | Representation |
---|---|
bin | 1011111011001010101101… |
… | …0000001000011001011111 |
3 | 1201102102002000211000121210 |
4 | 2332302223100020121133 |
5 | 3204303030002220111 |
6 | 43515055020355503 |
7 | 2522150416263006 |
oct | 276625320103137 |
9 | 51372060730553 |
10 | 13111113320031 |
11 | 41a5434732701 |
12 | 15790313a5b93 |
13 | 7414aca1aa6c |
14 | 33481d013c3d |
15 | 17b0b43970a6 |
hex | becab40865f |
13111113320031 has 16 divisors (see below), whose sum is σ = 17962961186304. Its totient is φ = 8502285714624.
The previous prime is 13111113320023. The next prime is 13111113320087. The reversal of 13111113320031 is 13002331111131.
It is not a de Polignac number, because 13111113320031 - 23 = 13111113320023 is a prime.
It is a super-2 number, since 2×131111133200312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13111113320131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 285212046 + ... + 285258011.
It is an arithmetic number, because the mean of its divisors is an integer number (1122685074144).
Almost surely, 213111113320031 is an apocalyptic number.
13111113320031 is a deficient number, since it is larger than the sum of its proper divisors (4851847866273).
13111113320031 is a wasteful number, since it uses less digits than its factorization.
13111113320031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 570470270.
The product of its (nonzero) digits is 162, while the sum is 21.
Adding to 13111113320031 its reverse (13002331111131), we get a palindrome (26113444431162).
The spelling of 13111113320031 in words is "thirteen trillion, one hundred eleven billion, one hundred thirteen million, three hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •