Base | Representation |
---|---|
bin | 101101100001011100010010… |
… | …100000111000000011000111 |
3 | 222020212220112211220221012020 |
4 | 231201130102200320003013 |
5 | 202220221003021023421 |
6 | 1545451145023054223 |
7 | 60112465446265665 |
oct | 5541342240700307 |
9 | 866786484827166 |
10 | 200210211111111 |
11 | 5887a745780453 |
12 | 1a5560b6741373 |
13 | 8793984c43026 |
14 | 3762323cddc35 |
15 | 1822dd8bc2dc6 |
hex | b617128380c7 |
200210211111111 has 8 divisors (see below), whose sum is σ = 266947443498624. Its totient is φ = 133473226398840.
The previous prime is 200210211111103. The next prime is 200210211111149. The reversal of 200210211111111 is 111111112012002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200210211111111 - 23 = 200210211111103 is a prime.
200210211111111 is a modest number, since divided by 11111111 gives 2002102 as remainder.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200210211111151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60024361 + ... + 63271986.
It is an arithmetic number, because the mean of its divisors is an integer number (33368430437328).
Almost surely, 2200210211111111 is an apocalyptic number.
200210211111111 is a deficient number, since it is larger than the sum of its proper divisors (66737232387513).
200210211111111 is a wasteful number, since it uses less digits than its factorization.
200210211111111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 123837621.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 200210211111111 its reverse (111111112012002), we get a palindrome (311321323123113).
The spelling of 200210211111111 in words is "two hundred trillion, two hundred ten billion, two hundred eleven million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •