Base | Representation |
---|---|
bin | 1011000110001100101011… |
… | …1001100100110000000011 |
3 | 1121012102012102022011020020 |
4 | 2301203022321210300003 |
5 | 3044400333432223021 |
6 | 41541040233144523 |
7 | 2366333624054532 |
oct | 261431271446003 |
9 | 47172172264206 |
10 | 12201111211011 |
11 | 398450a218308 |
12 | 14507a755b143 |
13 | 6a6737cb6568 |
14 | 3027734ba319 |
15 | 1625a3be27c6 |
hex | b18cae64c03 |
12201111211011 has 8 divisors (see below), whose sum is σ = 16474074209280. Its totient is φ = 8031111176712.
The previous prime is 12201111210991. The next prime is 12201111211033. The reversal of 12201111211011 is 11011211110221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12201111211011 - 235 = 12166751472643 is a prime.
It is a super-2 number, since 2×122011112110112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12201111211511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25740740715 + ... + 25740741188.
It is an arithmetic number, because the mean of its divisors is an integer number (2059259276160).
Almost surely, 212201111211011 is an apocalyptic number.
12201111211011 is a deficient number, since it is larger than the sum of its proper divisors (4272962998269).
12201111211011 is an equidigital number, since it uses as much as digits as its factorization.
12201111211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51481481985.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 12201111211011 its reverse (11011211110221), we get a palindrome (23212322321232).
The spelling of 12201111211011 in words is "twelve trillion, two hundred one billion, one hundred eleven million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •