Base | Representation |
---|---|
bin | 1010011110001010000011… |
… | …1000001010100011011011 |
3 | 1111202122121111111122000001 |
4 | 2213202200320022203123 |
5 | 3002113024111244011 |
6 | 40253032445353431 |
7 | 2265542053314634 |
oct | 247424070124333 |
9 | 44678544448001 |
10 | 11513211431131 |
11 | 37397a8782133 |
12 | 135b407268877 |
13 | 6568ca6a0ba7 |
14 | 2bb35724088b |
15 | 14e7420a57c1 |
hex | a78a0e0a8db |
11513211431131 has 16 divisors (see below), whose sum is σ = 12313805452416. Its totient is φ = 10726477565056.
The previous prime is 11513211431053. The next prime is 11513211431149. The reversal of 11513211431131 is 13113411231511.
It is a cyclic number.
It is not a de Polignac number, because 11513211431131 - 219 = 11513210906843 is a prime.
It is a super-2 number, since 2×115132114311312 (a number of 27 digits) contains 22 as substring.
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 11513211431131.
It is not an unprimeable number, because it can be changed into a prime (11513211431191) 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, 43921 + ... + 4798786.
It is an arithmetic number, because the mean of its divisors is an integer number (769612840776).
Almost surely, 211513211431131 is an apocalyptic number.
11513211431131 is a deficient number, since it is larger than the sum of its proper divisors (800594021285).
11513211431131 is a wasteful number, since it uses less digits than its factorization.
11513211431131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4844138.
The product of its digits is 1080, while the sum is 28.
Adding to 11513211431131 its reverse (13113411231511), we get a palindrome (24626622662642).
The spelling of 11513211431131 in words is "eleven trillion, five hundred thirteen billion, two hundred eleven million, four hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •