Base | Representation |
---|---|
bin | 1010111011001000100000… |
… | …0110101011010001100111 |
3 | 1120112020112002010020011211 |
4 | 2232302020012223101213 |
5 | 3033242023033323421 |
6 | 41313441023412251 |
7 | 2346524034402121 |
oct | 256621006532147 |
9 | 46466462106154 |
10 | 12011012011111 |
11 | 3910929176833 |
12 | 141b993754087 |
13 | 691830c612a9 |
14 | 2d749c2d8211 |
15 | 15c679a839e1 |
hex | aec881ab467 |
12011012011111 has 2 divisors, whose sum is σ = 12011012011112. Its totient is φ = 12011012011110.
The previous prime is 12011012011099. The next prime is 12011012011133. The reversal of 12011012011111 is 11111021011021.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12011012011111 - 25 = 12011012011079 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12011012011091 and 12011012011100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52011012011111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6005506005555 + 6005506005556.
It is an arithmetic number, because the mean of its divisors is an integer number (6005506005556).
Almost surely, 212011012011111 is an apocalyptic number.
12011012011111 is a deficient number, since it is larger than the sum of its proper divisors (1).
12011012011111 is an equidigital number, since it uses as much as digits as its factorization.
12011012011111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 12011012011111 its reverse (11111021011021), we get a palindrome (23122033022132).
The spelling of 12011012011111 in words is "twelve trillion, eleven billion, twelve million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •