Base | Representation |
---|---|
bin | 111000011001000111… |
… | …1100010111000001111 |
3 | 102120120210211000220010 |
4 | 1300302033202320033 |
5 | 3441004104120421 |
6 | 131344500324303 |
7 | 11515010121012 |
oct | 1606217427017 |
9 | 376523730803 |
10 | 121102020111 |
11 | 473a4a2a146 |
12 | 1b5789a3693 |
13 | b55c5c4687 |
14 | 5c0b84d379 |
15 | 323bada076 |
hex | 1c323e2e0f |
121102020111 has 4 divisors (see below), whose sum is σ = 161469360152. Its totient is φ = 80734680072.
The previous prime is 121102020103. The next prime is 121102020113. The reversal of 121102020111 is 111020201121.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 121102020111 - 23 = 121102020103 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (121102020113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20183670016 + ... + 20183670021.
It is an arithmetic number, because the mean of its divisors is an integer number (40367340038).
Almost surely, 2121102020111 is an apocalyptic number.
121102020111 is a deficient number, since it is larger than the sum of its proper divisors (40367340041).
121102020111 is an equidigital number, since it uses as much as digits as its factorization.
121102020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40367340040.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 121102020111 its reverse (111020201121), we get a palindrome (232122221232).
It can be divided in two parts, 1 and 21102020111, that added together give a palindrome (21102020112).
The spelling of 121102020111 in words is "one hundred twenty-one billion, one hundred two million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •