Base | Representation |
---|---|
bin | 11011110010011010110011… |
… | …100100110001000100010011 |
3 | 121000201100120020222120022001 |
4 | 123302122303210301010103 |
5 | 112004310200110401321 |
6 | 1111531231235054431 |
7 | 34512345406515133 |
oct | 3362326344610423 |
9 | 530640506876261 |
10 | 122212012200211 |
11 | 35a3890690aa8a |
12 | 1185960b741417 |
13 | 532670a826b8b |
14 | 22271430b6ac3 |
15 | e1e035437c91 |
hex | 6f26b3931113 |
122212012200211 has 8 divisors (see below), whose sum is σ = 125508140087904. Its totient is φ = 118930900841280.
The previous prime is 122212012200167. The next prime is 122212012200259. The reversal of 122212012200211 is 112002210212221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 122212012200211 - 227 = 122211877982483 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (122212412200211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3754115695 + ... + 3754148248.
It is an arithmetic number, because the mean of its divisors is an integer number (15688517510988).
Almost surely, 2122212012200211 is an apocalyptic number.
122212012200211 is a deficient number, since it is larger than the sum of its proper divisors (3296127887693).
122212012200211 is an equidigital number, since it uses as much as digits as its factorization.
122212012200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7508264381.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 122212012200211 its reverse (112002210212221), we get a palindrome (234214222412432).
The spelling of 122212012200211 in words is "one hundred twenty-two trillion, two hundred twelve billion, twelve million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •