Base | Representation |
---|---|
bin | 11101100000011100111… |
… | …100011001110011100101 |
3 | 21011211212121101211112001 |
4 | 131200130330121303211 |
5 | 231210222300110401 |
6 | 4151303413525301 |
7 | 266332355656603 |
oct | 35403474316345 |
9 | 7154777354461 |
10 | 2027710160101 |
11 | 711a4658324a |
12 | 288b98043831 |
13 | 11929b400a02 |
14 | 701dab52873 |
15 | 37b2aa90601 |
hex | 1d81cf19ce5 |
2027710160101 has 8 divisors (see below), whose sum is σ = 2029346468864. Its totient is φ = 2026074178800.
The previous prime is 2027710160089. The next prime is 2027710160111. The reversal of 2027710160101 is 1010610177202.
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-2027710160101 is a prime.
It is a super-2 number, since 2×20277101601012 (a number of 25 digits) contains 22 as substring.
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 2027710160101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2027710160111) 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, 13164931 + ... + 13318063.
It is an arithmetic number, because the mean of its divisors is an integer number (253668308608).
Almost surely, 22027710160101 is an apocalyptic number.
It is an amenable number.
2027710160101 is a deficient number, since it is larger than the sum of its proper divisors (1636308763).
2027710160101 is a wasteful number, since it uses less digits than its factorization.
2027710160101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 163731.
The product of its (nonzero) digits is 1176, while the sum is 28.
The spelling of 2027710160101 in words is "two trillion, twenty-seven billion, seven hundred ten million, one hundred sixty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •