Base | Representation |
---|---|
bin | 11011110000111100110000… |
… | …000101110011100110010011 |
3 | 121000100200220002010220112122 |
4 | 123300330300011303212103 |
5 | 112001131333114133021 |
6 | 1111413010141044455 |
7 | 34502141650250612 |
oct | 3360746005634623 |
9 | 530320802126478 |
10 | 122111022021011 |
11 | 359a9aa2559671 |
12 | 11841b2625672b |
13 | 531a034b383aa |
14 | 22222c2743879 |
15 | e1b5c430bbab |
hex | 6f0f30173993 |
122111022021011 has 4 divisors (see below), whose sum is σ = 122111146018152. Its totient is φ = 122110898023872.
The previous prime is 122111022021007. The next prime is 122111022021031. The reversal of 122111022021011 is 110120220111221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 122111022021011 - 22 = 122111022021007 is a prime.
It is a super-2 number, since 2×1221110220210112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122111022021031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 60509465 + ... + 62494938.
It is an arithmetic number, because the mean of its divisors is an integer number (30527786504538).
Almost surely, 2122111022021011 is an apocalyptic number.
122111022021011 is a deficient number, since it is larger than the sum of its proper divisors (123997141).
122111022021011 is an equidigital number, since it uses as much as digits as its factorization.
122111022021011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 123997140.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 122111022021011 its reverse (110120220111221), we get a palindrome (232231242132232).
The spelling of 122111022021011 in words is "one hundred twenty-two trillion, one hundred eleven billion, twenty-two million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •