Base | Representation |
---|---|
bin | 11011110001000110111111… |
… | …000101011110101110101011 |
3 | 121000101202020220212111021022 |
4 | 123301012333011132232223 |
5 | 112001321334304341021 |
6 | 1111422024413203055 |
7 | 34503011164162343 |
oct | 3361067705365653 |
9 | 530352226774238 |
10 | 122122011012011 |
11 | 35a0372155820a |
12 | 1184409249048b |
13 | 531b0966a9b2a |
14 | 2222a45d89d23 |
15 | e1ba18e241ab |
hex | 6f11bf15ebab |
122122011012011 has 4 divisors (see below), whose sum is σ = 122302398030432. Its totient is φ = 121941623993592.
The previous prime is 122122011011993. The next prime is 122122011012059. The reversal of 122122011012011 is 110210110221221.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122122011012011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122122011002011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 90193508195 + ... + 90193509548.
It is an arithmetic number, because the mean of its divisors is an integer number (30575599507608).
Almost surely, 2122122011012011 is an apocalyptic number.
122122011012011 is a deficient number, since it is larger than the sum of its proper divisors (180387018421).
122122011012011 is an equidigital number, since it uses as much as digits as its factorization.
122122011012011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180387018420.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 122122011012011 its reverse (110210110221221), we get a palindrome (232332121233232).
The spelling of 122122011012011 in words is "one hundred twenty-two trillion, one hundred twenty-two billion, eleven million, twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •