Base | Representation |
---|---|
bin | 1011110100101101001001… |
… | …1101000001001110100001 |
3 | 1201000210112110011120021121 |
4 | 2331023102131001032201 |
5 | 3200443202034012012 |
6 | 43352055255452241 |
7 | 2511140433402151 |
oct | 275132235011641 |
9 | 51023473146247 |
10 | 13000101860257 |
11 | 4162348651926 |
12 | 155b60b987081 |
13 | 733b9ab00865 |
14 | 32d2cb77c761 |
15 | 1782685a7a07 |
hex | bd2d27413a1 |
13000101860257 has 2 divisors, whose sum is σ = 13000101860258. Its totient is φ = 13000101860256.
The previous prime is 13000101860219. The next prime is 13000101860293. The reversal of 13000101860257 is 75206810100031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12998108773521 + 1993086736 = 3605289^2 + 44644^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13000101860257 is a prime.
It is a super-2 number, since 2×130001018602572 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13000101060257) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6500050930128 + 6500050930129.
It is an arithmetic number, because the mean of its divisors is an integer number (6500050930129).
Almost surely, 213000101860257 is an apocalyptic number.
It is an amenable number.
13000101860257 is a deficient number, since it is larger than the sum of its proper divisors (1).
13000101860257 is an equidigital number, since it uses as much as digits as its factorization.
13000101860257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10080, while the sum is 34.
Adding to 13000101860257 its reverse (75206810100031), we get a palindrome (88206911960288).
The spelling of 13000101860257 in words is "thirteen trillion, one hundred one million, eight hundred sixty thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •