Base | Representation |
---|---|
bin | 1011110000111010110… |
… | …0011101101110010100 |
3 | 201022200101121210101022 |
4 | 2330032230131232110 |
5 | 11302410130000040 |
6 | 232503102420312 |
7 | 20413321440365 |
oct | 2741654355624 |
9 | 638611553338 |
10 | 202110000020 |
11 | 7879490a475 |
12 | 33206291698 |
13 | 1609c4cb8b6 |
14 | 9ad4411b6c |
15 | 53cd8146b5 |
hex | 2f0eb1db94 |
202110000020 has 24 divisors (see below), whose sum is σ = 438122323968. Its totient is φ = 78236128800.
The previous prime is 202109999981. The next prime is 202110000041. The reversal of 202110000020 is 20000011202.
202110000020 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 202109999962 and 202110000007.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 162991316 + ... + 162992555.
It is an arithmetic number, because the mean of its divisors is an integer number (18255096832).
Almost surely, 2202110000020 is an apocalyptic number.
202110000020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202110000020 is an abundant number, since it is smaller than the sum of its proper divisors (236012323948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202110000020 is a wasteful number, since it uses less digits than its factorization.
202110000020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325983911 (or 325983909 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 202110000020 its reverse (20000011202), we get a palindrome (222110011222).
The spelling of 202110000020 in words is "two hundred two billion, one hundred ten million, twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •