Base | Representation |
---|---|
bin | 1011111100010101001101… |
… | …0010001100110111101111 |
3 | 1201111022200210102200021212 |
4 | 2333011103102030313233 |
5 | 3210120004222212421 |
6 | 43532203312145035 |
7 | 2523456126656024 |
oct | 277052322146757 |
9 | 51438623380255 |
10 | 13131112304111 |
11 | 420296762841a |
12 | 1580a92b3817b |
13 | 74334912b159 |
14 | 33579911354b |
15 | 17b884eb1e5b |
hex | bf15348cdef |
13131112304111 has 4 divisors (see below), whose sum is σ = 13133621598912. Its totient is φ = 13128603009312.
The previous prime is 13131112304071. The next prime is 13131112304147. The reversal of 13131112304111 is 11140321113131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13131112304111 is a prime.
It is a super-2 number, since 2×131311123041112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13131112304911) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1254639551 + ... + 1254650016.
It is an arithmetic number, because the mean of its divisors is an integer number (3283405399728).
Almost surely, 213131112304111 is an apocalyptic number.
13131112304111 is a deficient number, since it is larger than the sum of its proper divisors (2509294801).
13131112304111 is an equidigital number, since it uses as much as digits as its factorization.
13131112304111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2509294800.
The product of its (nonzero) digits is 216, while the sum is 23.
Adding to 13131112304111 its reverse (11140321113131), we get a palindrome (24271433417242).
The spelling of 13131112304111 in words is "thirteen trillion, one hundred thirty-one billion, one hundred twelve million, three hundred four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •