Base | Representation |
---|---|
bin | 1011101001000100000… |
… | …0000010011101100101 |
3 | 201010020102112202100201 |
4 | 2322101000002131211 |
5 | 11234100301431041 |
6 | 231513531510501 |
7 | 20310134111305 |
oct | 2722100023545 |
9 | 633212482321 |
10 | 200001202021 |
11 | 77902512305 |
12 | 32917bb8431 |
13 | 15b2465032a |
14 | 9974315605 |
15 | 5308610631 |
hex | 2e91002765 |
200001202021 has 4 divisors (see below), whose sum is σ = 201981412044. Its totient is φ = 198020992000.
The previous prime is 200001202019. The next prime is 200001202039. The reversal of 200001202021 is 120202100002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 96131002500 + 103870199521 = 310050^2 + 322289^2 .
It is a cyclic number.
It is not a de Polignac number, because 200001202021 - 21 = 200001202019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200001201989 and 200001202007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200001202721) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 990104860 + ... + 990105061.
It is an arithmetic number, because the mean of its divisors is an integer number (50495353011).
Almost surely, 2200001202021 is an apocalyptic number.
It is an amenable number.
200001202021 is a deficient number, since it is larger than the sum of its proper divisors (1980210023).
200001202021 is a wasteful number, since it uses less digits than its factorization.
200001202021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1980210022.
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 200001202021 its reverse (120202100002), we get a palindrome (320203302023).
The spelling of 200001202021 in words is "two hundred billion, one million, two hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •