Base | Representation |
---|---|
bin | 1011101001000100011… |
… | …1101100101110001001 |
3 | 201010020120022202221210 |
4 | 2322101013230232021 |
5 | 11234101310210441 |
6 | 231514042523333 |
7 | 20310160143651 |
oct | 2722107545611 |
9 | 633216282853 |
10 | 200003210121 |
11 | 77903663aa0 |
12 | 32918806549 |
13 | 15b24ba4360 |
14 | 99746b9361 |
15 | 53088aa616 |
hex | 2e911ecb89 |
200003210121 has 32 divisors (see below), whose sum is σ = 331720679808. Its totient is φ = 105308144640.
The previous prime is 200003210107. The next prime is 200003210123. The reversal of 200003210121 is 121012300002.
200003210121 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 200003210121 - 225 = 199969655689 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 200003210097 and 200003210106.
It is not an unprimeable number, because it can be changed into a prime (200003210123) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 13704706 + ... + 13719291.
It is an arithmetic number, because the mean of its divisors is an integer number (10366271244).
Almost surely, 2200003210121 is an apocalyptic number.
It is an amenable number.
200003210121 is a deficient number, since it is larger than the sum of its proper divisors (131717469687).
200003210121 is a wasteful number, since it uses less digits than its factorization.
200003210121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27424041.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 200003210121 its reverse (121012300002), we get a palindrome (321015510123).
The spelling of 200003210121 in words is "two hundred billion, three million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •