Base | Representation |
---|---|
bin | 10111001111001111001000… |
… | …100010001110000101011111 |
3 | 111101212102111212002021000201 |
4 | 113033033020202032011133 |
5 | 101343434410433101421 |
6 | 1001211000212404331 |
7 | 30345600406530655 |
oct | 2717171042160537 |
9 | 441772455067021 |
10 | 102202111222111 |
11 | 2a62374342161a |
12 | b5675543166a7 |
13 | 4504805216224 |
14 | 1b34873d10dd5 |
15 | bc37a1253b91 |
hex | 5cf3c888e15f |
102202111222111 has 4 divisors (see below), whose sum is σ = 103641577577424. Its totient is φ = 100762644866800.
The previous prime is 102202111222069. The next prime is 102202111222199. The reversal of 102202111222111 is 111222111202201.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102202111222111 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 (102202111222511) 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, 719733177550 + ... + 719733177691.
It is an arithmetic number, because the mean of its divisors is an integer number (25910394394356).
Almost surely, 2102202111222111 is an apocalyptic number.
102202111222111 is a deficient number, since it is larger than the sum of its proper divisors (1439466355313).
102202111222111 is an equidigital number, since it uses as much as digits as its factorization.
102202111222111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1439466355312.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 102202111222111 its reverse (111222111202201), we get a palindrome (213424222424312).
The spelling of 102202111222111 in words is "one hundred two trillion, two hundred two 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 •