Base | Representation |
---|---|
bin | 101101100010111011001100… |
… | …001110111100110101011111 |
3 | 222021020122120102221220201102 |
4 | 231202323030032330311133 |
5 | 202223403200433101421 |
6 | 1550010040304103315 |
7 | 60123033565035500 |
oct | 5542731416746537 |
9 | 867218512856642 |
10 | 200312111222111 |
11 | 58909986728019 |
12 | 1a5719b4904b3b |
13 | 87a04742c49b5 |
14 | 376722d456ba7 |
15 | 182589eb3d60b |
hex | b62ecc3bcd5f |
200312111222111 has 12 divisors (see below), whose sum is σ = 233050903099560. Its totient is φ = 171670472593200.
The previous prime is 200312111222101. The next prime is 200312111222257. The reversal of 200312111222111 is 111222111213002.
It is not a de Polignac number, because 200312111222111 - 210 = 200312111221087 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200312111222101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 304700921 + ... + 305357618.
It is an arithmetic number, because the mean of its divisors is an integer number (19420908591630).
Almost surely, 2200312111222111 is an apocalyptic number.
200312111222111 is a deficient number, since it is larger than the sum of its proper divisors (32738791877449).
200312111222111 is an equidigital number, since it uses as much as digits as its factorization.
200312111222111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 610065254 (or 610065247 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 200312111222111 its reverse (111222111213002), we get a palindrome (311534222435113).
The spelling of 200312111222111 in words is "two hundred trillion, three hundred twelve billion, one hundred eleven million, two hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •