Base | Representation |
---|---|
bin | 11101011001100011010… |
… | …011011100001010000001 |
3 | 21011010202020010201022210 |
4 | 131121203103130022001 |
5 | 231100033432411234 |
6 | 4144040250452333 |
7 | 265650635230440 |
oct | 35314323341201 |
9 | 7133666121283 |
10 | 2020300669569 |
11 | 709894071356 |
12 | 28766a7340a9 |
13 | 11868a3127a0 |
14 | 6dad6a80d57 |
15 | 3784533abe9 |
hex | 1d6634dc281 |
2020300669569 has 32 divisors (see below), whose sum is σ = 3510386691840. Its totient is φ = 1002967621632.
The previous prime is 2020300669537. The next prime is 2020300669601. The reversal of 2020300669569 is 9659660030202.
It is an interprime number because it is at equal distance from previous prime (2020300669537) and next prime (2020300669601).
It is not a de Polignac number, because 2020300669569 - 25 = 2020300669537 is a prime.
It is a super-2 number, since 2×20203006695692 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2020300669969) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 217653264 + ... + 217662545.
It is an arithmetic number, because the mean of its divisors is an integer number (109699584120).
Almost surely, 22020300669569 is an apocalyptic number.
It is an amenable number.
2020300669569 is a deficient number, since it is larger than the sum of its proper divisors (1490086022271).
2020300669569 is a wasteful number, since it uses less digits than its factorization.
2020300669569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435315849.
The product of its (nonzero) digits is 1049760, while the sum is 48.
The spelling of 2020300669569 in words is "two trillion, twenty billion, three hundred million, six hundred sixty-nine thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •