Base | Representation |
---|---|
bin | 10111001101111001010110… |
… | …111100001001010000000011 |
3 | 111101112121210020110101222212 |
4 | 113031321112330021100003 |
5 | 101340432300320232321 |
6 | 1001100405211252335 |
7 | 30336130156450610 |
oct | 2715712674112003 |
9 | 441477706411885 |
10 | 102110011102211 |
11 | 2a5986812a0352 |
12 | b55173014a0ab |
13 | 44c8c18293668 |
14 | 1b30218135507 |
15 | bc11b083955b |
hex | 5cde56f09403 |
102110011102211 has 12 divisors (see below), whose sum is σ = 118120085063472. Its totient is φ = 86468374248816.
The previous prime is 102110011102157. The next prime is 102110011102237. The reversal of 102110011102211 is 112201110011201.
It is not a de Polignac number, because 102110011102211 - 218 = 102110010840067 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102110011102291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1058679056 + ... + 1058775501.
It is an arithmetic number, because the mean of its divisors is an integer number (9843340421956).
Almost surely, 2102110011102211 is an apocalyptic number.
102110011102211 is a deficient number, since it is larger than the sum of its proper divisors (16010073961261).
102110011102211 is an frugal number, since it uses more digits than its factorization.
102110011102211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2117454730 (or 2117454647 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102110011102211 its reverse (112201110011201), we get a palindrome (214311121113412).
The spelling of 102110011102211 in words is "one hundred two trillion, one hundred ten billion, eleven million, one hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •