Base | Representation |
---|---|
bin | 101101100001011101001000… |
… | …110000101000011101001001 |
3 | 222020212222220021102210211021 |
4 | 231201131020300220131021 |
5 | 202220224334012224314 |
6 | 1545451415213432441 |
7 | 60112530140102023 |
oct | 5541351060503511 |
9 | 866788807383737 |
10 | 200211121211209 |
11 | 58880072481099 |
12 | 1a55630b49b721 |
13 | 8793a9b6649b4 |
14 | 37623acb29013 |
15 | 1822e3da47324 |
hex | b61748c28749 |
200211121211209 has 4 divisors (see below), whose sum is σ = 200212512164116. Its totient is φ = 200209730258304.
The previous prime is 200211121211183. The next prime is 200211121211267. The reversal of 200211121211209 is 902112121112002.
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 40463084323600 + 159748036887609 = 6361060^2 + 12639147^2 .
It is a cyclic number.
It is not a de Polignac number, because 200211121211209 - 211 = 200211121209161 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (200211121251209) 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, 695260524 + ... + 695548429.
It is an arithmetic number, because the mean of its divisors is an integer number (50053128041029).
Almost surely, 2200211121211209 is an apocalyptic number.
It is an amenable number.
200211121211209 is a deficient number, since it is larger than the sum of its proper divisors (1390952907).
200211121211209 is a wasteful number, since it uses less digits than its factorization.
200211121211209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1390952906.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 200211121211209 in words is "two hundred trillion, two hundred eleven billion, one hundred twenty-one million, two hundred eleven thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •