Base | Representation |
---|---|
bin | 1010010011100100001011… |
… | …0111010010010101100011 |
3 | 1111010020220222112101100201 |
4 | 2210321002313102111203 |
5 | 2441122342323004011 |
6 | 40033300300330031 |
7 | 2246440553464132 |
oct | 244710267222543 |
9 | 44106828471321 |
10 | 11331245516131 |
11 | 3679610763a12 |
12 | 13300a3243917 |
13 | 6426bb687738 |
14 | 2b26142dd919 |
15 | 149b41ebdcc1 |
hex | a4e42dd2563 |
11331245516131 has 4 divisors (see below), whose sum is σ = 11333391184264. Its totient is φ = 11329099848000.
The previous prime is 11331245516093. The next prime is 11331245516233. The reversal of 11331245516131 is 13161554213311.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11331245516131 - 29 = 11331245515619 is a prime.
It is a super-2 number, since 2×113312455161312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11331245516831) 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, 1072826145 + ... + 1072836706.
It is an arithmetic number, because the mean of its divisors is an integer number (2833347796066).
Almost surely, 211331245516131 is an apocalyptic number.
11331245516131 is a deficient number, since it is larger than the sum of its proper divisors (2145668133).
11331245516131 is an equidigital number, since it uses as much as digits as its factorization.
11331245516131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2145668132.
The product of its digits is 32400, while the sum is 37.
Adding to 11331245516131 its reverse (13161554213311), we get a palindrome (24492799729442).
The spelling of 11331245516131 in words is "eleven trillion, three hundred thirty-one billion, two hundred forty-five million, five hundred sixteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •