Base | Representation |
---|---|
bin | 101011111110100100011… |
… | …100110101000111011111 |
3 | 101200220121210220001000122 |
4 | 223332210130311013133 |
5 | 344003300440430421 |
6 | 10232202045545155 |
7 | 431224655624201 |
oct | 53764434650737 |
9 | 11626553801018 |
10 | 3022121030111 |
11 | a65746598047 |
12 | 40985a2751bb |
13 | 18bca5779931 |
14 | a63b2b80771 |
15 | 5392b7cd2ab |
hex | 2bfa47351df |
3022121030111 has 2 divisors, whose sum is σ = 3022121030112. Its totient is φ = 3022121030110.
The previous prime is 3022121030059. The next prime is 3022121030113. The reversal of 3022121030111 is 1110301212203.
It is a strong prime.
It is an emirp because it is prime and its reverse (1110301212203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3022121030111 - 238 = 2747243123167 is a prime.
Together with 3022121030113, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3022121030111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3022121030113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1511060515055 + 1511060515056.
It is an arithmetic number, because the mean of its divisors is an integer number (1511060515056).
Almost surely, 23022121030111 is an apocalyptic number.
3022121030111 is a deficient number, since it is larger than the sum of its proper divisors (1).
3022121030111 is an equidigital number, since it uses as much as digits as its factorization.
3022121030111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 3022121030111 its reverse (1110301212203), we get a palindrome (4132422242314).
The spelling of 3022121030111 in words is "three trillion, twenty-two billion, one hundred twenty-one million, thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •