Base | Representation |
---|---|
bin | 1011111011001011110011… |
… | …1000110100010001001111 |
3 | 1201102102211122120012002222 |
4 | 2332302330320310101033 |
5 | 3204304131223320114 |
6 | 43515144230205555 |
7 | 2522160641224316 |
oct | 276627470642117 |
9 | 51372748505088 |
10 | 13111409198159 |
11 | 41a5576751288 |
12 | 15790b44b38bb |
13 | 74152910468c |
14 | 33484a43327d |
15 | 17b0d033e98e |
hex | becbce3444f |
13111409198159 has 2 divisors, whose sum is σ = 13111409198160. Its totient is φ = 13111409198158.
The previous prime is 13111409198143. The next prime is 13111409198171. The reversal of 13111409198159 is 95189190411131.
It is a strong prime.
It is an emirp because it is prime and its reverse (95189190411131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13111409198159 - 24 = 13111409198143 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13111409198159.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13111409198959) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555704599079 + 6555704599080.
It is an arithmetic number, because the mean of its divisors is an integer number (6555704599080).
Almost surely, 213111409198159 is an apocalyptic number.
13111409198159 is a deficient number, since it is larger than the sum of its proper divisors (1).
13111409198159 is an equidigital number, since it uses as much as digits as its factorization.
13111409198159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 349920, while the sum is 53.
The spelling of 13111409198159 in words is "thirteen trillion, one hundred eleven billion, four hundred nine million, one hundred ninety-eight thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •