Base | Representation |
---|---|
bin | 10001101000110010000… |
… | …101001100101110010111 |
3 | 11021212102211100020102211 |
4 | 101220302011030232113 |
5 | 124324204334013421 |
6 | 2324443400214251 |
7 | 153365003345344 |
oct | 21506205145627 |
9 | 4255384306384 |
10 | 1212021001111 |
11 | 428019292158 |
12 | 176a9346a387 |
13 | 8a3a6bc350b |
14 | 4293ac517cb |
15 | 217da2089e1 |
hex | 11a3214cb97 |
1212021001111 has 2 divisors, whose sum is σ = 1212021001112. Its totient is φ = 1212021001110.
The previous prime is 1212021001063. The next prime is 1212021001129. The reversal of 1212021001111 is 1111001202121.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1212021001111 is a prime.
It is a super-2 number, since 2×12120210011112 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1212021001091 and 1212021001100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1212021001151) 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 as a sum of consecutive naturals, namely, 606010500555 + 606010500556.
It is an arithmetic number, because the mean of its divisors is an integer number (606010500556).
Almost surely, 21212021001111 is an apocalyptic number.
1212021001111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212021001111 is an equidigital number, since it uses as much as digits as its factorization.
1212021001111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1212021001111 its reverse (1111001202121), we get a palindrome (2323022203232).
The spelling of 1212021001111 in words is "one trillion, two hundred twelve billion, twenty-one million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •