Base | Representation |
---|---|
bin | 11011101111011111101100… |
… | …010010010011110001001011 |
3 | 121000000010222100121110201110 |
4 | 123233133230102103301023 |
5 | 111443012213122400021 |
6 | 1111255043045421403 |
7 | 34462003542632331 |
oct | 3357375422236113 |
9 | 530003870543643 |
10 | 122011100200011 |
11 | 35970687270610 |
12 | 1182669a70a863 |
13 | 531079c59c219 |
14 | 221b523c33b51 |
15 | e18bc6db6476 |
hex | 6ef7ec493c4b |
122011100200011 has 32 divisors (see below), whose sum is σ = 182268837619200. Its totient is φ = 71946929652480.
The previous prime is 122011100199997. The next prime is 122011100200021. The reversal of 122011100200011 is 110002001110221.
It is not a de Polignac number, because 122011100200011 - 219 = 122011099675723 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122011100200011.
It is not an unprimeable number, because it can be changed into a prime (122011100200021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 158062930 + ... + 158832968.
It is an arithmetic number, because the mean of its divisors is an integer number (5695901175600).
Almost surely, 2122011100200011 is an apocalyptic number.
122011100200011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
122011100200011 is a deficient number, since it is larger than the sum of its proper divisors (60257737419189).
122011100200011 is a wasteful number, since it uses less digits than its factorization.
122011100200011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 899859.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 122011100200011 its reverse (110002001110221), we get a palindrome (232013101310232).
The spelling of 122011100200011 in words is "one hundred twenty-two trillion, eleven billion, one hundred million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •