Base | Representation |
---|---|
bin | 101101100001011101111101… |
… | …010000100101000011010111 |
3 | 222020220002011122210120102111 |
4 | 231201131331100211003113 |
5 | 202220233140003013421 |
6 | 1545452042440051451 |
7 | 60112561023511432 |
oct | 5541357520450327 |
9 | 866802148716374 |
10 | 200212002001111 |
11 | 58880484682631 |
12 | 1a556516463b87 |
13 | 8793babc93659 |
14 | 3762453ac4819 |
15 | 1822e9102bee1 |
hex | b6177d4250d7 |
200212002001111 has 4 divisors (see below), whose sum is σ = 200246479706592. Its totient is φ = 200177524295632.
The previous prime is 200212002001061. The next prime is 200212002001153. The reversal of 200212002001111 is 111100200212002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200212002001111 - 245 = 165027629912279 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200212002001091 and 200212002001100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200212002004111) 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, 17238844030 + ... + 17238855643.
It is an arithmetic number, because the mean of its divisors is an integer number (50061619926648).
Almost surely, 2200212002001111 is an apocalyptic number.
200212002001111 is a deficient number, since it is larger than the sum of its proper divisors (34477705481).
200212002001111 is an equidigital number, since it uses as much as digits as its factorization.
200212002001111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34477705480.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200212002001111 its reverse (111100200212002), we get a palindrome (311312202213113).
The spelling of 200212002001111 in words is "two hundred trillion, two hundred twelve billion, two million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •