Base | Representation |
---|---|
bin | 1011110000100011011… |
… | …1000011000010101100 |
3 | 201022102120102111220210 |
4 | 2330020313003002230 |
5 | 11302210100023040 |
6 | 232445244342420 |
7 | 20411022416616 |
oct | 2741067030254 |
9 | 638376374823 |
10 | 202012111020 |
11 | 7874462aa75 |
12 | 33199544a10 |
13 | 16085146c05 |
14 | 9ac540ddb6 |
15 | 53c4e2a480 |
hex | 2f08dc30ac |
202012111020 has 48 divisors (see below), whose sum is σ = 569430136800. Its totient is φ = 53508350976.
The previous prime is 202012111013. The next prime is 202012111033. The reversal of 202012111020 is 20111210202.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 202012110987 and 202012111005.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11289277 + ... + 11307156.
It is an arithmetic number, because the mean of its divisors is an integer number (11863127850).
Almost surely, 2202012111020 is an apocalyptic number.
202012111020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202012111020 is an abundant number, since it is smaller than the sum of its proper divisors (367418025780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202012111020 is a wasteful number, since it uses less digits than its factorization.
202012111020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22596594 (or 22596592 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 202012111020 its reverse (20111210202), we get a palindrome (222123321222).
The spelling of 202012111020 in words is "two hundred two billion, twelve million, one hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •