Base | Representation |
---|---|
bin | 1011111011001010101001… |
… | …1110000101100001100001 |
3 | 1201102102001010010111202212 |
4 | 2332302222132011201201 |
5 | 3204303013122413212 |
6 | 43515053431251505 |
7 | 2522150166623165 |
oct | 276625236054141 |
9 | 51372033114685 |
10 | 13111100201057 |
11 | 41a5428292181 |
12 | 1579028b19b95 |
13 | 7414aa0a6661 |
14 | 33481b39aca5 |
15 | 17b0b3154e22 |
hex | becaa785861 |
13111100201057 has 2 divisors, whose sum is σ = 13111100201058. Its totient is φ = 13111100201056.
The previous prime is 13111100201047. The next prime is 13111100201071. The reversal of 13111100201057 is 75010200111131.
13111100201057 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9211170370081 + 3899929830976 = 3034991^2 + 1974824^2 .
It is a cyclic number.
It is not a de Polignac number, because 13111100201057 - 24 = 13111100201041 is a prime.
It is not a weakly prime, because it can be changed into another prime (13111100201047) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555550100528 + 6555550100529.
It is an arithmetic number, because the mean of its divisors is an integer number (6555550100529).
Almost surely, 213111100201057 is an apocalyptic number.
It is an amenable number.
13111100201057 is a deficient number, since it is larger than the sum of its proper divisors (1).
13111100201057 is an equidigital number, since it uses as much as digits as its factorization.
13111100201057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 210, while the sum is 23.
Adding to 13111100201057 its reverse (75010200111131), we get a palindrome (88121300312188).
The spelling of 13111100201057 in words is "thirteen trillion, one hundred eleven billion, one hundred million, two hundred one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •