Base | Representation |
---|---|
bin | 11011100000111011100011… |
… | …001111100101001111000011 |
3 | 120212110110112101000122201221 |
4 | 123200323203033211033003 |
5 | 111330112413101011321 |
6 | 1105211154513135511 |
7 | 34326462042014266 |
oct | 3340734317451703 |
9 | 525413471018657 |
10 | 121010221110211 |
11 | 356151680a5524 |
12 | 116a471225a597 |
13 | 526a2a414b804 |
14 | 21c4cd6b54cdd |
15 | decb483a3e41 |
hex | 6e0ee33e53c3 |
121010221110211 has 8 divisors (see below), whose sum is σ = 121124831251424. Its totient is φ = 120895612421760.
The previous prime is 121010221110169. The next prime is 121010221110223. The reversal of 121010221110211 is 112011122010121.
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 121010221110211 - 29 = 121010221109699 is a prime.
It is a super-2 number, since 2×1210102211102112 (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 (121010221110511) 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, 243903085 + ... + 244398721.
It is an arithmetic number, because the mean of its divisors is an integer number (15140603906428).
Almost surely, 2121010221110211 is an apocalyptic number.
121010221110211 is a deficient number, since it is larger than the sum of its proper divisors (114610141213).
121010221110211 is a wasteful number, since it uses less digits than its factorization.
121010221110211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 726381.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 121010221110211 its reverse (112011122010121), we get a palindrome (233021343120332).
The spelling of 121010221110211 in words is "one hundred twenty-one trillion, ten billion, two hundred twenty-one million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.616 sec. • engine limits •