Base | Representation |
---|---|
bin | 1011111011001010101001… |
… | …1110000101100001101111 |
3 | 1201102102001010010111210101 |
4 | 2332302222132011201233 |
5 | 3204303013122413241 |
6 | 43515053431251531 |
7 | 2522150166623215 |
oct | 276625236054157 |
9 | 51372033114711 |
10 | 13111100201071 |
11 | 41a5428292194 |
12 | 1579028b19ba7 |
13 | 7414aa0a6672 |
14 | 33481b39acb5 |
15 | 17b0b3154e31 |
hex | becaa78586f |
13111100201071 has 2 divisors, whose sum is σ = 13111100201072. Its totient is φ = 13111100201070.
The previous prime is 13111100201057. The next prime is 13111100201077. The reversal of 13111100201071 is 17010200111131.
It is a strong prime.
It is an emirp because it is prime and its reverse (17010200111131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13111100201071 - 27 = 13111100200943 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13111100201077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555550100535 + 6555550100536.
It is an arithmetic number, because the mean of its divisors is an integer number (6555550100536).
Almost surely, 213111100201071 is an apocalyptic number.
13111100201071 is a deficient number, since it is larger than the sum of its proper divisors (1).
13111100201071 is an equidigital number, since it uses as much as digits as its factorization.
13111100201071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42, while the sum is 19.
The spelling of 13111100201071 in words is "thirteen trillion, one hundred eleven billion, one hundred million, two hundred one thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •