Base | Representation |
---|---|
bin | 1010000110001110110011… |
… | …0010011100111000111011 |
3 | 1110022100122012001000101101 |
4 | 2201203230302130320323 |
5 | 2423344220021010441 |
6 | 35340133213232231 |
7 | 2224051035101566 |
oct | 241435462347073 |
9 | 43270565030341 |
10 | 11102168141371 |
11 | 35a044853478a |
12 | 12b3811792677 |
13 | 626c1218c188 |
14 | 2a54c253d4dd |
15 | 143bd5e1b231 |
hex | a18ecc9ce3b |
11102168141371 has 2 divisors, whose sum is σ = 11102168141372. Its totient is φ = 11102168141370.
The previous prime is 11102168141327. The next prime is 11102168141447. The reversal of 11102168141371 is 17314186120111.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11102168141371 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11102168141371.
It is not a weakly prime, because it can be changed into another prime (11102168141671) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551084070685 + 5551084070686.
It is an arithmetic number, because the mean of its divisors is an integer number (5551084070686).
Almost surely, 211102168141371 is an apocalyptic number.
11102168141371 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102168141371 is an equidigital number, since it uses as much as digits as its factorization.
11102168141371 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 37.
The spelling of 11102168141371 in words is "eleven trillion, one hundred two billion, one hundred sixty-eight million, one hundred forty-one thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •