Base | Representation |
---|---|
bin | 1010000110001110001111… |
… | …1101110010111000111001 |
3 | 1110022100020212111202101212 |
4 | 2201203203331302320321 |
5 | 2423343414122320441 |
6 | 35340110404452505 |
7 | 2224044256663010 |
oct | 241434375627071 |
9 | 43270225452355 |
10 | 11102020120121 |
11 | 35a0381a24177 |
12 | 12b37900aa135 |
13 | 626bba603b38 |
14 | 2a54aaa0ba77 |
15 | 143bc7e2ceeb |
hex | a18e3f72e39 |
11102020120121 has 8 divisors (see below), whose sum is σ = 12688480722624. Its totient is φ = 9515673949680.
The previous prime is 11102020120097. The next prime is 11102020120123. The reversal of 11102020120121 is 12102102020111.
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 11102020120121 - 226 = 11101953011257 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11102020120096 and 11102020120105.
It is not an unprimeable number, because it can be changed into a prime (11102020120123) 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, 28400015 + ... + 28788276.
It is an arithmetic number, because the mean of its divisors is an integer number (1586060090328).
Almost surely, 211102020120121 is an apocalyptic number.
It is an amenable number.
11102020120121 is a deficient number, since it is larger than the sum of its proper divisors (1586460602503).
11102020120121 is an equidigital number, since it uses as much as digits as its factorization.
11102020120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57216031.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11102020120121 its reverse (12102102020111), we get a palindrome (23204122140232).
The spelling of 11102020120121 in words is "eleven trillion, one hundred two billion, twenty million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •