Base | Representation |
---|---|
bin | 11101000110101001111… |
… | …001011100110001101101 |
3 | 21002012101011001011210010 |
4 | 131012221321130301231 |
5 | 230232010102432341 |
6 | 4130443023403433 |
7 | 264332055136113 |
oct | 35065171346155 |
9 | 7065334034703 |
10 | 2000010202221 |
11 | 701221689979 |
12 | 283747453579 |
13 | 1167a56c6ca5 |
14 | 6cb2dd87ab3 |
15 | 37058d45716 |
hex | 1d1a9e5cc6d |
2000010202221 has 8 divisors (see below), whose sum is σ = 2666687655744. Its totient is φ = 1333336441760.
The previous prime is 2000010202219. The next prime is 2000010202241. The reversal of 2000010202221 is 1222020100002.
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 2000010202221 - 21 = 2000010202219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2000010202197 and 2000010202206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000010202241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 799720 + ... + 2153966.
It is an arithmetic number, because the mean of its divisors is an integer number (333335956968).
Almost surely, 22000010202221 is an apocalyptic number.
It is an amenable number.
2000010202221 is a deficient number, since it is larger than the sum of its proper divisors (666677453523).
2000010202221 is a wasteful number, since it uses less digits than its factorization.
2000010202221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1846531.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 2000010202221 its reverse (1222020100002), we get a palindrome (3222030302223).
The spelling of 2000010202221 in words is "two trillion, ten million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •