Base | Representation |
---|---|
bin | 11101000110110110011… |
… | …110011000110111001101 |
3 | 21002012220212002120221011 |
4 | 131012312132120313031 |
5 | 230232423112241414 |
6 | 4130520002205221 |
7 | 264340226530231 |
oct | 35066636306715 |
9 | 7065825076834 |
10 | 2000221212109 |
11 | 70131a80180a |
12 | 2837a6053811 |
13 | 11680a337703 |
14 | 6cb4ddd45c1 |
15 | 3706c626dc4 |
hex | 1d1b6798dcd |
2000221212109 has 4 divisors (see below), whose sum is σ = 2000353683420. Its totient is φ = 2000088740800.
The previous prime is 2000221212107. The next prime is 2000221212139. The reversal of 2000221212109 is 9012121220002.
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 150629372100 + 1849591840009 = 388110^2 + 1359997^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000221212109 - 21 = 2000221212107 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2000221212109.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000221212107) 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, 66213004 + ... + 66243205.
It is an arithmetic number, because the mean of its divisors is an integer number (500088420855).
Almost surely, 22000221212109 is an apocalyptic number.
It is an amenable number.
2000221212109 is a deficient number, since it is larger than the sum of its proper divisors (132471311).
2000221212109 is a wasteful number, since it uses less digits than its factorization.
2000221212109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 132471310.
The product of its (nonzero) digits is 288, while the sum is 22.
The spelling of 2000221212109 in words is "two trillion, two hundred twenty-one million, two hundred twelve thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •