Base | Representation |
---|---|
bin | 1011000000111101011001… |
… | …1011000010100110110011 |
3 | 1120212210220002120002222121 |
4 | 2300033112123002212303 |
5 | 3041412023204021321 |
6 | 41431433415415111 |
7 | 2356666413213412 |
oct | 260172633024663 |
9 | 46783802502877 |
10 | 12111110220211 |
11 | 394a324a8a882 |
12 | 143726a384497 |
13 | 69b0c3c08312 |
14 | 2dc276401479 |
15 | 16008771c441 |
hex | b03d66c29b3 |
12111110220211 has 8 divisors (see below), whose sum is σ = 12118744826064. Its totient is φ = 12103477647360.
The previous prime is 12111110220203. The next prime is 12111110220239. The reversal of 12111110220211 is 11202201111121.
12111110220211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12111110220211 - 23 = 12111110220203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12111110220311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11499240 + ... + 12508186.
It is an arithmetic number, because the mean of its divisors is an integer number (1514843103258).
Almost surely, 212111110220211 is an apocalyptic number.
12111110220211 is a deficient number, since it is larger than the sum of its proper divisors (7634605853).
12111110220211 is a wasteful number, since it uses less digits than its factorization.
12111110220211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1016501.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 12111110220211 its reverse (11202201111121), we get a palindrome (23313311331332).
The spelling of 12111110220211 in words is "twelve trillion, one hundred eleven billion, one hundred ten million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •