Base | Representation |
---|---|
bin | 10111001101111001011100… |
… | …111001101011101011100110 |
3 | 111101112122001012122211202012 |
4 | 113031321130321223223212 |
5 | 101340433001421320402 |
6 | 1001100423143114222 |
7 | 30336132512546141 |
oct | 2715713471535346 |
9 | 441478035584665 |
10 | 102110111120102 |
11 | 2a5987227a4268 |
12 | b551759742972 |
13 | 44c8c32c12347 |
14 | 1b3022752d058 |
15 | bc11b94e4452 |
hex | 5cde5ce6bae6 |
102110111120102 has 8 divisors (see below), whose sum is σ = 153169744751256. Its totient is φ = 51053529536352.
The previous prime is 102110111120089. The next prime is 102110111120107. The reversal of 102110111120102 is 201021111011201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102110111120107) 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 3 ways as a sum of consecutive naturals, for example, 762928208 + ... + 763062035.
It is an arithmetic number, because the mean of its divisors is an integer number (19146218093907).
Almost surely, 2102110111120102 is an apocalyptic number.
102110111120102 is a deficient number, since it is larger than the sum of its proper divisors (51059633631154).
102110111120102 is a wasteful number, since it uses less digits than its factorization.
102110111120102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1526023702.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102110111120102 its reverse (201021111011201), we get a palindrome (303131222131303).
The spelling of 102110111120102 in words is "one hundred two trillion, one hundred ten billion, one hundred eleven million, one hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •