Base | Representation |
---|---|
bin | 10001101000110010000… |
… | …101100100111001001111 |
3 | 11021212102211112021020111 |
4 | 101220302011210321033 |
5 | 124324204400200421 |
6 | 2324443402300451 |
7 | 153365004240103 |
oct | 21506205447117 |
9 | 4255384467214 |
10 | 1212021100111 |
11 | 42801934a578 |
12 | 176a934b7727 |
13 | 8a3a6c295b3 |
14 | 4293ac79903 |
15 | 217da227ee1 |
hex | 11a32164e4f |
1212021100111 has 2 divisors, whose sum is σ = 1212021100112. Its totient is φ = 1212021100110.
The previous prime is 1212021100099. The next prime is 1212021100153. The reversal of 1212021100111 is 1110011202121.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1212021100111 - 219 = 1212020575823 is a prime.
It is a super-2 number, since 2×12120211001112 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1212021100091 and 1212021100100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1212021100211) 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, 606010550055 + 606010550056.
It is an arithmetic number, because the mean of its divisors is an integer number (606010550056).
Almost surely, 21212021100111 is an apocalyptic number.
1212021100111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212021100111 is an equidigital number, since it uses as much as digits as its factorization.
1212021100111 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 1212021100111 its reverse (1110011202121), we get a palindrome (2322032302232).
The spelling of 1212021100111 in words is "one trillion, two hundred twelve billion, twenty-one million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •