Base | Representation |
---|---|
bin | 11011100001000100110110… |
… | …000010110111010101101011 |
3 | 120212111102021211110221220012 |
4 | 123201010312002313111223 |
5 | 111330243332224020021 |
6 | 1105215525032122135 |
7 | 34330264244032001 |
oct | 3341046602672553 |
9 | 525442254427805 |
10 | 121020200220011 |
11 | 35619419041404 |
12 | 116a663823634b |
13 | 526b204703601 |
14 | 21c55a21daa71 |
15 | ded02e4d735b |
hex | 6e11360b756b |
121020200220011 has 4 divisors (see below), whose sum is σ = 121021128013992. Its totient is φ = 121019272426032.
The previous prime is 121020200219993. The next prime is 121020200220041. The reversal of 121020200220011 is 110022002020121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 121020200220011 - 210 = 121020200218987 is a prime.
It is a super-2 number, since 2×1210202002200112 (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 (121020200220041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 463701305 + ... + 463962218.
It is an arithmetic number, because the mean of its divisors is an integer number (30255282003498).
Almost surely, 2121020200220011 is an apocalyptic number.
121020200220011 is a deficient number, since it is larger than the sum of its proper divisors (927793981).
121020200220011 is an equidigital number, since it uses as much as digits as its factorization.
121020200220011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 927793980.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 121020200220011 its reverse (110022002020121), we get a palindrome (231042202240132).
The spelling of 121020200220011 in words is "one hundred twenty-one trillion, twenty billion, two hundred million, two hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •