Base | Representation |
---|---|
bin | 11110101110101011001… |
… | …110000000000110110000 |
3 | 21110212200002221211110221 |
4 | 132232223032000012300 |
5 | 234044231042013340 |
6 | 4254034032102424 |
7 | 305364634505455 |
oct | 36565316000660 |
9 | 7425602854427 |
10 | 2111701516720 |
11 | 7446274aa664 |
12 | 2a1318694a14 |
13 | 12419541bcb3 |
14 | 742c7a3182c |
15 | 39de467844a |
hex | 1ebab3801b0 |
2111701516720 has 40 divisors (see below), whose sum is σ = 5079006239760. Its totient is φ = 815553688320.
The previous prime is 2111701516643. The next prime is 2111701516741. The reversal of 2111701516720 is 276151071112.
It is a tau number, because it is divible by the number of its divisors (40).
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 455105766 + ... + 455110405.
It is an arithmetic number, because the mean of its divisors is an integer number (126975155994).
Almost surely, 22111701516720 is an apocalyptic number.
2111701516720 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2111701516720 is an abundant number, since it is smaller than the sum of its proper divisors (2967304723040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2111701516720 is a wasteful number, since it uses less digits than its factorization.
2111701516720 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 910216213 (or 910216207 counting only the distinct ones).
The product of its (nonzero) digits is 5880, while the sum is 34.
Adding to 2111701516720 its reverse (276151071112), we get a palindrome (2387852587832).
The spelling of 2111701516720 in words is "two trillion, one hundred eleven billion, seven hundred one million, five hundred sixteen thousand, seven hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •