Base | Representation |
---|---|
bin | 1011101001001000100… |
… | …0100101100001110101 |
3 | 201010021202022222011002 |
4 | 2322102020211201311 |
5 | 11234120134020041 |
6 | 231515451253045 |
7 | 20310454550336 |
oct | 2722210454165 |
9 | 633252288132 |
10 | 200020220021 |
11 | 77912221866 |
12 | 3292244a185 |
13 | 15b2857b79b |
14 | 9976a6628d |
15 | 530a11a59b |
hex | 2e92225875 |
200020220021 has 8 divisors (see below), whose sum is σ = 201387942144. Its totient is φ = 198655914240.
The previous prime is 200020219951. The next prime is 200020220047. The reversal of 200020220021 is 120022020002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200020220021 - 218 = 200019957877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200020219984 and 200020220011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200020220821) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 736535 + ... + 970836.
It is an arithmetic number, because the mean of its divisors is an integer number (25173492768).
Almost surely, 2200020220021 is an apocalyptic number.
It is an amenable number.
200020220021 is a deficient number, since it is larger than the sum of its proper divisors (1367722123).
200020220021 is a wasteful number, since it uses less digits than its factorization.
200020220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1708171.
The product of its (nonzero) digits is 32, while the sum is 11.
Adding to 200020220021 its reverse (120022020002), we get a palindrome (320042240023).
The spelling of 200020220021 in words is "two hundred billion, twenty million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •