Base | Representation |
---|---|
bin | 11011100010100001111000… |
… | …101010101011001011001011 |
3 | 120212211222011011200100222112 |
4 | 123202201320222223023023 |
5 | 111333412432130400021 |
6 | 1105333450134212535 |
7 | 34340432020612625 |
oct | 3342417052531313 |
9 | 525758134610875 |
10 | 121120102200011 |
11 | 35657824108642 |
12 | 11701a791b414b |
13 | 5277765b13845 |
14 | 21ca35c223c15 |
15 | e00929d0dd5b |
hex | 6e2878aab2cb |
121120102200011 has 8 divisors (see below), whose sum is σ = 121170937887984. Its totient is φ = 121069276685280.
The previous prime is 121120102199909. The next prime is 121120102200029. The reversal of 121120102200011 is 110002201021121.
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 121120102200011 - 246 = 50751358022347 is a prime.
It is a super-2 number, since 2×1211201022000112 (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 (121120102200511) 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, 21320141 + ... + 26396753.
It is an arithmetic number, because the mean of its divisors is an integer number (15146367235998).
Almost surely, 2121120102200011 is an apocalyptic number.
121120102200011 is a deficient number, since it is larger than the sum of its proper divisors (50835687973).
121120102200011 is an equidigital number, since it uses as much as digits as its factorization.
121120102200011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5086621.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 121120102200011 its reverse (110002201021121), we get a palindrome (231122303221132).
The spelling of 121120102200011 in words is "one hundred twenty-one trillion, one hundred twenty billion, one hundred two million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •