Base | Representation |
---|---|
bin | 11011110010011010001010… |
… | …111011101000110110011011 |
3 | 121000201021210201220222020012 |
4 | 123302122022323220312123 |
5 | 112004302301031030021 |
6 | 1111531035440152135 |
7 | 34512322456643306 |
oct | 3362321273506633 |
9 | 530637721828205 |
10 | 122211330330011 |
11 | 35a38596a2389a |
12 | 1185945b30864b |
13 | 532662c4948a0 |
14 | 22270ba6dbb3d |
15 | e1dee564735b |
hex | 6f268aee8d9b |
122211330330011 has 8 divisors (see below), whose sum is σ = 131806606928304. Its totient is φ = 112643825879520.
The previous prime is 122211330329917. The next prime is 122211330330029. The reversal of 122211330330011 is 110033033112221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122211330330011 - 222 = 122211326135707 is a prime.
It is a super-2 number, since 2×1222113303300112 (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 (122211330332011) 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, 6943027805 + ... + 6943045406.
It is an arithmetic number, because the mean of its divisors is an integer number (16475825866038).
Almost surely, 2122211330330011 is an apocalyptic number.
122211330330011 is a deficient number, since it is larger than the sum of its proper divisors (9595276598293).
122211330330011 is a wasteful number, since it uses less digits than its factorization.
122211330330011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13886073901.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 122211330330011 its reverse (110033033112221), we get a palindrome (232244363442232).
The spelling of 122211330330011 in words is "one hundred twenty-two trillion, two hundred eleven billion, three hundred thirty million, three hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •