Base | Representation |
---|---|
bin | 11101011001111101101… |
… | …010101001110110000001 |
3 | 21011011220001101112020201 |
4 | 131121331222221312001 |
5 | 231101440144300221 |
6 | 4144152210405201 |
7 | 265664615530411 |
oct | 35317552516601 |
9 | 7134801345221 |
10 | 2020742962561 |
11 | 709aa07a3654 |
12 | 287772890801 |
13 | 11872ab4150b |
14 | 6db396d4641 |
15 | 3786e0a5891 |
hex | 1d67daa9d81 |
2020742962561 has 8 divisors (see below), whose sum is σ = 2073258778248. Its totient is φ = 1968380928000.
The previous prime is 2020742962559. The next prime is 2020742962591. The reversal of 2020742962561 is 1652692470202.
It can be written as a sum of positive squares in 4 ways, for example, as 327475785025 + 1693267177536 = 572255^2 + 1301256^2 .
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 2020742962561 - 21 = 2020742962559 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2020742962591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38418660 + ... + 38471221.
It is an arithmetic number, because the mean of its divisors is an integer number (259157347281).
Almost surely, 22020742962561 is an apocalyptic number.
It is an amenable number.
2020742962561 is a deficient number, since it is larger than the sum of its proper divisors (52515815687).
2020742962561 is an equidigital number, since it uses as much as digits as its factorization.
2020742962561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76890563.
The product of its (nonzero) digits is 725760, while the sum is 46.
The spelling of 2020742962561 in words is "two trillion, twenty billion, seven hundred forty-two million, nine hundred sixty-two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •