Base | Representation |
---|---|
bin | 1010111011001001010010… |
… | …1000100100010110001101 |
3 | 1120112021001201200001121111 |
4 | 2232302110220210112031 |
5 | 3033242440342102341 |
6 | 41313513533132021 |
7 | 2346532166225365 |
oct | 256622450442615 |
9 | 46467051601544 |
10 | 12011222222221 |
11 | 3910a268a3522 |
12 | 141ba3202a011 |
13 | 691865682271 |
14 | 2d74bc1b79a5 |
15 | 15c68d258681 |
hex | aec94a2458d |
12011222222221 has 2 divisors, whose sum is σ = 12011222222222. Its totient is φ = 12011222222220.
The previous prime is 12011222222081. The next prime is 12011222222227. The reversal of 12011222222221 is 12222222211021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8416880206596 + 3594342015625 = 2901186^2 + 1895875^2 .
It is a cyclic number.
It is not a de Polignac number, because 12011222222221 - 227 = 12011088004493 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12011222222192 and 12011222222201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12011222222227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6005611111110 + 6005611111111.
It is an arithmetic number, because the mean of its divisors is an integer number (6005611111111).
Almost surely, 212011222222221 is an apocalyptic number.
It is an amenable number.
12011222222221 is a deficient number, since it is larger than the sum of its proper divisors (1).
12011222222221 is an equidigital number, since it uses as much as digits as its factorization.
12011222222221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 12011222222221 its reverse (12222222211021), we get a palindrome (24233444433242).
The spelling of 12011222222221 in words is "twelve trillion, eleven billion, two hundred twenty-two million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •