Base | Representation |
---|---|
bin | 11011101111010110011110… |
… | …110010111100111111001011 |
3 | 120222222012110002211102020011 |
4 | 123233112132302330333023 |
5 | 111442331434302400021 |
6 | 1111250325432412351 |
7 | 34461203502212152 |
oct | 3357263662747713 |
9 | 528865402742204 |
10 | 122001210200011 |
11 | 3596747165819a |
12 | 1182479a5470b7 |
13 | 530c88461710c |
14 | 221ac66546599 |
15 | e187e89d5de1 |
hex | 6ef59ecbcfcb |
122001210200011 has 8 divisors (see below), whose sum is σ = 129286396008000. Its totient is φ = 114921240893760.
The previous prime is 122001210199991. The next prime is 122001210200033. The reversal of 122001210200011 is 110002012100221.
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 122001210200011 - 217 = 122001210068939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122001210199964 and 122001210200000.
It is not an unprimeable number, because it can be changed into a prime (122001210200081) 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, 51304124211 + ... + 51304126588.
It is an arithmetic number, because the mean of its divisors is an integer number (16160799501000).
Almost surely, 2122001210200011 is an apocalyptic number.
122001210200011 is a deficient number, since it is larger than the sum of its proper divisors (7285185807989).
122001210200011 is a wasteful number, since it uses less digits than its factorization.
122001210200011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102608250869.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 122001210200011 its reverse (110002012100221), we get a palindrome (232003222300232).
The spelling of 122001210200011 in words is "one hundred twenty-two trillion, one billion, two hundred ten million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •