Base | Representation |
---|---|
bin | 10111001101110001111111… |
… | …100001010110110011100111 |
3 | 111101111212101001002221122212 |
4 | 113031301333201112303213 |
5 | 101340320101103323421 |
6 | 1001053020320114035 |
7 | 30335430161340146 |
oct | 2715617741266347 |
9 | 441455331087585 |
10 | 102102102011111 |
11 | 2a595292875124 |
12 | b5500a346591b |
13 | 44c82578300b7 |
14 | 1b2daa797375d |
15 | bc0d9b2e9e5b |
hex | 5cdc7f856ce7 |
102102102011111 has 8 divisors (see below), whose sum is σ = 102506377722480. Its totient is φ = 101697880496128.
The previous prime is 102102102011083. The next prime is 102102102011159. The reversal of 102102102011111 is 111110201201201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102102102011111 - 210 = 102102102010087 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 (102102102011011) 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 7 ways as a sum of consecutive naturals, for example, 9771701 + ... + 17311566.
It is an arithmetic number, because the mean of its divisors is an integer number (12813297215310).
Almost surely, 2102102102011111 is an apocalyptic number.
102102102011111 is a deficient number, since it is larger than the sum of its proper divisors (404275711369).
102102102011111 is a wasteful number, since it uses less digits than its factorization.
102102102011111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27098193.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102102102011111 its reverse (111110201201201), we get a palindrome (213212303212312).
The spelling of 102102102011111 in words is "one hundred two trillion, one hundred two billion, one hundred two million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •