Base | Representation |
---|---|
bin | 11001000010010100111101… |
… | …000011111110011111000110 |
3 | 112102212111222221201101010110 |
4 | 121002110331003332133012 |
5 | 103413030013330120402 |
6 | 1030104201432133450 |
7 | 32123156505562260 |
oct | 3102247503763706 |
9 | 472774887641113 |
10 | 110111101020102 |
11 | 320a2945a31a76 |
12 | 10424328b37286 |
13 | 4959580918440 |
14 | 1d2959744ab30 |
15 | cae3982e356c |
hex | 64253d0fe7c6 |
110111101020102 has 64 divisors (see below), whose sum is σ = 278368188908544. Its totient is φ = 28255417660800.
The previous prime is 110111101020097. The next prime is 110111101020143. The reversal of 110111101020102 is 201020101111011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2725232274 + ... + 2725272677.
It is an arithmetic number, because the mean of its divisors is an integer number (4349502951696).
Almost surely, 2110111101020102 is an apocalyptic number.
110111101020102 is an abundant number, since it is smaller than the sum of its proper divisors (168257087888442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110111101020102 is a wasteful number, since it uses less digits than its factorization.
110111101020102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5450505013.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 110111101020102 its reverse (201020101111011), we get a palindrome (311131202131113).
Subtracting 110111101020102 from its reverse (201020101111011), we obtain a palindrome (90909000090909).
The spelling of 110111101020102 in words is "one hundred ten trillion, one hundred eleven billion, one hundred one million, twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •