Base | Representation |
---|---|
bin | 11011100010011001100110… |
… | …101110001111010101111011 |
3 | 120212211010012112201021201011 |
4 | 123202121212232033111323 |
5 | 111333241230032210412 |
6 | 1105325420005334351 |
7 | 34336665500501356 |
oct | 3342314656172573 |
9 | 525733175637634 |
10 | 121111211210107 |
11 | 35653a814022a8 |
12 | 117001b77073b7 |
13 | 5276979b10181 |
14 | 21c9b574a729d |
15 | e005a94b67a7 |
hex | 6e2666b8f57b |
121111211210107 has 2 divisors, whose sum is σ = 121111211210108. Its totient is φ = 121111211210106.
The previous prime is 121111211210039. The next prime is 121111211210131. The reversal of 121111211210107 is 701012112111121.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (701012112111121) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-121111211210107 is a prime.
It is a super-3 number, since 3×1211112112101073 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (121111211210207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60555605605053 + 60555605605054.
It is an arithmetic number, because the mean of its divisors is an integer number (60555605605054).
Almost surely, 2121111211210107 is an apocalyptic number.
121111211210107 is a deficient number, since it is larger than the sum of its proper divisors (1).
121111211210107 is an equidigital number, since it uses as much as digits as its factorization.
121111211210107 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 22.
Adding to 121111211210107 its reverse (701012112111121), we get a palindrome (822123323321228).
The spelling of 121111211210107 in words is "one hundred twenty-one trillion, one hundred eleven billion, two hundred eleven million, two hundred ten thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •