Base | Representation |
---|---|
bin | 1011110000100000100… |
… | …0111011011001110110 |
3 | 201022101201200021200100 |
4 | 2330020020323121312 |
5 | 11302144001133420 |
6 | 232444133254530 |
7 | 20410514564226 |
oct | 2741010733166 |
9 | 638351607610 |
10 | 202000021110 |
11 | 78738822708 |
12 | 33195494446 |
13 | 160827a3014 |
14 | 9ac3984086 |
15 | 53c3d3d190 |
hex | 2f0823b676 |
202000021110 has 48 divisors (see below), whose sum is σ = 539394659856. Its totient is φ = 52410815424.
The previous prime is 202000021063. The next prime is 202000021129. The reversal of 202000021110 is 11120000202.
202000021110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 202000021092 and 202000021101.
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, 30327004 + ... + 30333663.
It is an arithmetic number, because the mean of its divisors is an integer number (11237388747).
Almost surely, 2202000021110 is an apocalyptic number.
202000021110 is an abundant number, since it is smaller than the sum of its proper divisors (337394638746).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202000021110 is a wasteful number, since it uses less digits than its factorization.
202000021110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60660717 (or 60660714 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 202000021110 its reverse (11120000202), we get a palindrome (213120021312).
The spelling of 202000021110 in words is "two hundred two billion, twenty-one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •