Base | Representation |
---|---|
bin | 11110101110001101010… |
… | …100111100011000100001 |
3 | 21110211101011022011022101 |
4 | 132232031110330120201 |
5 | 234042214201120001 |
6 | 4253512155210401 |
7 | 305346335036062 |
oct | 36561524743041 |
9 | 7424334264271 |
10 | 2111200020001 |
11 | 74439a410766 |
12 | 2a11b8746a01 |
13 | 124115561887 |
14 | 7427b1aa569 |
15 | 39db5616a01 |
hex | 1eb8d53c621 |
2111200020001 has 4 divisors (see below), whose sum is σ = 2111625070272. Its totient is φ = 2110774969732.
The previous prime is 2111200019989. The next prime is 2111200020023. The reversal of 2111200020001 is 1000200021112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2111200020001 - 217 = 2111199888929 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2111200020001.
It is not an unprimeable number, because it can be changed into a prime (2111200020031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 212517685 + ... + 212527618.
It is an arithmetic number, because the mean of its divisors is an integer number (527906267568).
Almost surely, 22111200020001 is an apocalyptic number.
It is an amenable number.
2111200020001 is a deficient number, since it is larger than the sum of its proper divisors (425050271).
2111200020001 is an equidigital number, since it uses as much as digits as its factorization.
2111200020001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425050270.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 2111200020001 its reverse (1000200021112), we get a palindrome (3111400041113).
The spelling of 2111200020001 in words is "two trillion, one hundred eleven billion, two hundred million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •