Base | Representation |
---|---|
bin | 1010111011001001010000… |
… | …0010000010000000101111 |
3 | 1120112021001000122211010021 |
4 | 2232302110002002000233 |
5 | 3033242430300320421 |
6 | 41313512532423011 |
7 | 2346532014322231 |
oct | 256622402020057 |
9 | 46467030584107 |
10 | 12011212120111 |
11 | 3910a21123676 |
12 | 141ba2a777a67 |
13 | 691863556099 |
14 | 2d74bab08251 |
15 | 15c68c410341 |
hex | aec9408202f |
12011212120111 has 4 divisors (see below), whose sum is σ = 12012425261224. Its totient is φ = 12009998979000.
The previous prime is 12011212120109. The next prime is 12011212120211. The reversal of 12011212120111 is 11102121211021.
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 12011212120111 - 21 = 12011212120109 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 (12011212120211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 606555705 + ... + 606575506.
It is an arithmetic number, because the mean of its divisors is an integer number (3003106315306).
Almost surely, 212011212120111 is an apocalyptic number.
12011212120111 is a deficient number, since it is larger than the sum of its proper divisors (1213141113).
12011212120111 is an equidigital number, since it uses as much as digits as its factorization.
12011212120111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1213141112.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 12011212120111 its reverse (11102121211021), we get a palindrome (23113333331132).
The spelling of 12011212120111 in words is "twelve trillion, eleven billion, two hundred twelve million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.905 sec. • engine limits •