Base | Representation |
---|---|
bin | 1010010011100011110000… |
… | …0110101011100100001001 |
3 | 1111010020122002010210220212 |
4 | 2210320330012223210021 |
5 | 2441122124310023423 |
6 | 40033241125530505 |
7 | 2246435005531223 |
oct | 244707406534411 |
9 | 44106562123825 |
10 | 11331132111113 |
11 | 3679562747061 |
12 | 1330071273a35 |
13 | 6426a102c589 |
14 | 2b260321d413 |
15 | 149b3706c578 |
hex | a4e3c1ab909 |
11331132111113 has 4 divisors (see below), whose sum is σ = 11333817854160. Its totient is φ = 11328446368068.
The previous prime is 11331132111109. The next prime is 11331132111133. The reversal of 11331132111113 is 31111123113311.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11331132111113 - 22 = 11331132111109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11331132111133) 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, 1342865195 + ... + 1342873632.
It is an arithmetic number, because the mean of its divisors is an integer number (2833454463540).
Almost surely, 211331132111113 is an apocalyptic number.
It is an amenable number.
11331132111113 is a deficient number, since it is larger than the sum of its proper divisors (2685743047).
11331132111113 is an equidigital number, since it uses as much as digits as its factorization.
11331132111113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2685743046.
The product of its digits is 162, while the sum is 23.
Adding to 11331132111113 its reverse (31111123113311), we get a palindrome (42442255224424).
The spelling of 11331132111113 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-two million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •