Base | Representation |
---|---|
bin | 11011101111011110101011… |
… | …111101111100101111110011 |
3 | 121000000001012011010120121120 |
4 | 123233132223331330233303 |
5 | 111443003010401333021 |
6 | 1111254344021153323 |
7 | 34461635030622402 |
oct | 3357365375745763 |
9 | 530001164116546 |
10 | 122010021121011 |
11 | 35970183145591 |
12 | 1182643925b843 |
13 | 5310659b64c3a |
14 | 221b4607bd639 |
15 | e18b622b42c6 |
hex | 6ef7abf7cbf3 |
122010021121011 has 8 divisors (see below), whose sum is σ = 162724683687360. Its totient is φ = 81317686317672.
The previous prime is 122010021120973. The next prime is 122010021121049. The reversal of 122010021121011 is 110121120010221.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (122010021120973) and next prime (122010021121049).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122010021121011 - 211 = 122010021118963 is a prime.
It is not an unprimeable number, because it can be changed into a prime (122010021121091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5581928001 + ... + 5581949858.
It is an arithmetic number, because the mean of its divisors is an integer number (20340585460920).
Almost surely, 2122010021121011 is an apocalyptic number.
122010021121011 is a deficient number, since it is larger than the sum of its proper divisors (40714662566349).
122010021121011 is a wasteful number, since it uses less digits than its factorization.
122010021121011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11163881505.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 122010021121011 its reverse (110121120010221), we get a palindrome (232131141131232).
The spelling of 122010021121011 in words is "one hundred twenty-two trillion, ten billion, twenty-one million, one hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •