Base | Representation |
---|---|
bin | 11011101111011111110010… |
… | …110101111101101011011011 |
3 | 121000000011021000121120001220 |
4 | 123233133302311331223123 |
5 | 111443012424303210021 |
6 | 1111255102015343123 |
7 | 34462006346665233 |
oct | 3357376265755333 |
9 | 530004230546056 |
10 | 122011210210011 |
11 | 35970733379771 |
12 | 1182670b521aa3 |
13 | 53107b9308cb5 |
14 | 221b5346accc3 |
15 | e18bd1896cc6 |
hex | 6ef7f2d7dadb |
122011210210011 has 8 divisors (see below), whose sum is σ = 165438929098560. Its totient is φ = 79962149064072.
The previous prime is 122011210210007. The next prime is 122011210210033. The reversal of 122011210210011 is 110012012110221.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 122011210210011 - 22 = 122011210210007 is a prime.
It is a super-2 number, since 2×1220112102100112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (122011210210051) 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, 344664435445 + ... + 344664435798.
It is an arithmetic number, because the mean of its divisors is an integer number (20679866137320).
Almost surely, 2122011210210011 is an apocalyptic number.
122011210210011 is a deficient number, since it is larger than the sum of its proper divisors (43427718888549).
122011210210011 is an equidigital number, since it uses as much as digits as its factorization.
122011210210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 689328871305.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 122011210210011 its reverse (110012012110221), we get a palindrome (232023222320232).
The spelling of 122011210210011 in words is "one hundred twenty-two trillion, eleven billion, two hundred ten million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •