Base | Representation |
---|---|
bin | 10111001101111010010111… |
… | …111101100101111111010111 |
3 | 111101112201121021011210221211 |
4 | 113031322113331211333113 |
5 | 101340442014103013421 |
6 | 1001101105341122251 |
7 | 30336166204110100 |
oct | 2715722775457727 |
9 | 441481537153854 |
10 | 102111102001111 |
11 | 2a599091059895 |
12 | b551995559387 |
13 | 44c90602a8978 |
14 | 1b302bcd853a7 |
15 | bc12264c39e1 |
hex | 5cde97f65fd7 |
102111102001111 has 12 divisors (see below), whose sum is σ = 118823820247800. Its totient is φ = 87493209563760.
The previous prime is 102111102001067. The next prime is 102111102001159. The reversal of 102111102001111 is 111100201111201.
It is not a de Polignac number, because 102111102001111 - 217 = 102111101870039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102111102001091 and 102111102001100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102111112001111) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 364050661 + ... + 364331038.
It is an arithmetic number, because the mean of its divisors is an integer number (9901985020650).
Almost surely, 2102111102001111 is an apocalyptic number.
102111102001111 is a deficient number, since it is larger than the sum of its proper divisors (16712718246689).
102111102001111 is an equidigital number, since it uses as much as digits as its factorization.
102111102001111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 728384574 (or 728384567 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 102111102001111 its reverse (111100201111201), we get a palindrome (213211303112312).
The spelling of 102111102001111 in words is "one hundred two trillion, one hundred eleven billion, one hundred two million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •