Base | Representation |
---|---|
bin | 11110101110001101011… |
… | …001001000111100010101 |
3 | 21110211101020101001020212 |
4 | 132232031121020330111 |
5 | 234042214441320041 |
6 | 4253512234535205 |
7 | 305346350300120 |
oct | 36561531107425 |
9 | 7424336331225 |
10 | 2111201120021 |
11 | 74439aaa2174 |
12 | 2a11b8b97505 |
13 | 124115858486 |
14 | 7427b3b53b7 |
15 | 39db57828eb |
hex | 1eb8d648f15 |
2111201120021 has 8 divisors (see below), whose sum is σ = 2428780097664. Its totient is φ = 1797616846800.
The previous prime is 2111201119987. The next prime is 2111201120071. The reversal of 2111201120021 is 1200211021112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2111201120021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2111201119978 and 2111201120005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2111201120071) 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, 998674970 + ... + 998677083.
It is an arithmetic number, because the mean of its divisors is an integer number (303597512208).
Almost surely, 22111201120021 is an apocalyptic number.
It is an amenable number.
2111201120021 is a deficient number, since it is larger than the sum of its proper divisors (317578977643).
2111201120021 is a wasteful number, since it uses less digits than its factorization.
2111201120021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1997352211.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2111201120021 its reverse (1200211021112), we get a palindrome (3311412141133).
The spelling of 2111201120021 in words is "two trillion, one hundred eleven billion, two hundred one million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •