Base | Representation |
---|---|
bin | 1011110000101111000… |
… | …1101000001100110101 |
3 | 201022112222110110011202 |
4 | 2330023301220030311 |
5 | 11302310110201010 |
6 | 232454152542245 |
7 | 20412155230343 |
oct | 2741361501465 |
9 | 638488413152 |
10 | 202061022005 |
11 | 7876a1a7577 |
12 | 331b19b1985 |
13 | 1609231071b |
14 | 9acbb02993 |
15 | 53c938c6a5 |
hex | 2f0bc68335 |
202061022005 has 24 divisors (see below), whose sum is σ = 248659149312. Its totient is φ = 157625050464.
The previous prime is 202061021993. The next prime is 202061022013. The reversal of 202061022005 is 500220160202.
202061022005 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 202061022005 - 212 = 202061017909 is a prime.
It is a super-2 number, since 2×2020610220052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 5593712 + ... + 5629718.
It is an arithmetic number, because the mean of its divisors is an integer number (10360797888).
Almost surely, 2202061022005 is an apocalyptic number.
It is an amenable number.
202061022005 is a deficient number, since it is larger than the sum of its proper divisors (46598127307).
202061022005 is an equidigital number, since it uses as much as digits as its factorization.
202061022005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36705 (or 36662 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 202061022005 its reverse (500220160202), we get a palindrome (702281182207).
The spelling of 202061022005 in words is "two hundred two billion, sixty-one million, twenty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •