Base | Representation |
---|---|
bin | 1010111011001001101100… |
… | …0100001011011000101111 |
3 | 1120112021100020201000002011 |
4 | 2232302123010023120233 |
5 | 3033243201002421221 |
6 | 41313532345542051 |
7 | 2346534646326001 |
oct | 256623304133057 |
9 | 46467306630064 |
10 | 12011330123311 |
11 | 3910a817a1182 |
12 | 141ba621a4927 |
13 | 691881b3116c |
14 | 2d74cc664371 |
15 | 15c69796e1e1 |
hex | aec9b10b62f |
12011330123311 has 4 divisors (see below), whose sum is σ = 12717878954112. Its totient is φ = 11304781292512.
The previous prime is 12011330123263. The next prime is 12011330123357. The reversal of 12011330123311 is 11332103311021.
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 12011330123311 - 213 = 12011330115119 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12011330123011) 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 3 ways as a sum of consecutive naturals, for example, 353274415375 + ... + 353274415408.
It is an arithmetic number, because the mean of its divisors is an integer number (3179469738528).
Almost surely, 212011330123311 is an apocalyptic number.
12011330123311 is a deficient number, since it is larger than the sum of its proper divisors (706548830801).
12011330123311 is an equidigital number, since it uses as much as digits as its factorization.
12011330123311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 706548830800.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 12011330123311 its reverse (11332103311021), we get a palindrome (23343433434332).
The spelling of 12011330123311 in words is "twelve trillion, eleven billion, three hundred thirty million, one hundred twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •