Base | Representation |
---|---|
bin | 101101100001011100001100… |
… | …100111001110010111101111 |
3 | 222020212220021221122021002121 |
4 | 231201130030213032113233 |
5 | 202220220302200041421 |
6 | 1545451131125133411 |
7 | 60112463134643113 |
oct | 5541341447162757 |
9 | 866786257567077 |
10 | 200210112112111 |
11 | 5887a6a4902aa2 |
12 | 1a55608955a267 |
13 | 879396a59003a |
14 | 3762314acd743 |
15 | 1822dd0169d41 |
hex | b6170c9ce5ef |
200210112112111 has 16 divisors (see below), whose sum is σ = 204644447429760. Its totient is φ = 195825087843840.
The previous prime is 200210112112099. The next prime is 200210112112117. The reversal of 200210112112111 is 111211211012002.
It is a cyclic number.
It is not a de Polignac number, because 200210112112111 - 215 = 200210112079343 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200210112112117) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11454681 + ... + 23057101.
It is an arithmetic number, because the mean of its divisors is an integer number (12790277964360).
Almost surely, 2200210112112111 is an apocalyptic number.
200210112112111 is a deficient number, since it is larger than the sum of its proper divisors (4434335317649).
200210112112111 is a wasteful number, since it uses less digits than its factorization.
200210112112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11604546.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 200210112112111 its reverse (111211211012002), we get a palindrome (311421323124113).
It can be divided in two parts, 20021011 and 2112111, that added together give a palindrome (22133122).
The spelling of 200210112112111 in words is "two hundred trillion, two hundred ten billion, one hundred twelve million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •