Base | Representation |
---|---|
bin | 10111001101111010011000… |
… | …100011110001100100011011 |
3 | 111101112201121222000022120211 |
4 | 113031322120203301210123 |
5 | 101340442024133310021 |
6 | 1001101110335431551 |
7 | 30336166355144416 |
oct | 2715723043614433 |
9 | 441481558008524 |
10 | 102111112010011 |
11 | 2a599096775705 |
12 | b5519989855b7 |
13 | 44c90623a15b0 |
14 | 1b302c042cb7d |
15 | bc12272ee3e1 |
hex | 5cde988f191b |
102111112010011 has 32 divisors (see below), whose sum is σ = 112693461027840. Its totient is φ = 91943235321600.
The previous prime is 102111112009943. The next prime is 102111112010143. The reversal of 102111112010011 is 110010211111201.
It is not a de Polignac number, because 102111112010011 - 231 = 102108964526363 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102111112009973 and 102111112010000.
It is not an unprimeable number, because it can be changed into a prime (102111112010911) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1297219191 + ... + 1297297903.
It is an arithmetic number, because the mean of its divisors is an integer number (3521670657120).
Almost surely, 2102111112010011 is an apocalyptic number.
102111112010011 is a deficient number, since it is larger than the sum of its proper divisors (10582349017829).
102111112010011 is a wasteful number, since it uses less digits than its factorization.
102111112010011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91827.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 102111112010011 its reverse (110010211111201), we get a palindrome (212121323121212).
The spelling of 102111112010011 in words is "one hundred two trillion, one hundred eleven billion, one hundred twelve million, ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •