Base | Representation |
---|---|
bin | 11011100010010001000111… |
… | …101010100010010110100111 |
3 | 120212210020200120202120200220 |
4 | 123202101013222202112213 |
5 | 111333114100123223421 |
6 | 1105321311541135423 |
7 | 34336223636335155 |
oct | 3342210752422647 |
9 | 525706616676626 |
10 | 121102100211111 |
11 | 35650126497968 |
12 | 116ba4943ba573 |
13 | 5275b57367bc6 |
14 | 21c953143a3d5 |
15 | e002246b13c6 |
hex | 6e2447aa25a7 |
121102100211111 has 8 divisors (see below), whose sum is σ = 161491747847424. Its totient is φ = 80723593024440.
The previous prime is 121102100211089. The next prime is 121102100211137. The reversal of 121102100211111 is 111112001201121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 121102100211111 - 27 = 121102100210983 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121102100211151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2785087045 + ... + 2785130526.
It is an arithmetic number, because the mean of its divisors is an integer number (20186468480928).
Almost surely, 2121102100211111 is an apocalyptic number.
121102100211111 is a deficient number, since it is larger than the sum of its proper divisors (40389647636313).
121102100211111 is an equidigital number, since it uses as much as digits as its factorization.
121102100211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5570224821.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 121102100211111 its reverse (111112001201121), we get a palindrome (232214101412232).
The spelling of 121102100211111 in words is "one hundred twenty-one trillion, one hundred two billion, one hundred million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •