Base | Representation |
---|---|
bin | 1011111100101111010001… |
… | …1011101010000100000101 |
3 | 1201111222202112111021101022 |
4 | 2333023310123222010011 |
5 | 3210223322341211203 |
6 | 43535322000040525 |
7 | 2524124430623243 |
oct | 277136433520405 |
9 | 51458675437338 |
10 | 13138110882053 |
11 | 42059290a0633 |
12 | 1582306903145 |
13 | 743bc3056a31 |
14 | 335c607bd793 |
15 | 17bb445e9a38 |
hex | bf2f46ea105 |
13138110882053 has 2 divisors, whose sum is σ = 13138110882054. Its totient is φ = 13138110882052.
The previous prime is 13138110882037. The next prime is 13138110882151. The reversal of 13138110882053 is 35028801183131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11350309236484 + 1787801645569 = 3369022^2 + 1337087^2 .
It is a cyclic number.
It is not a de Polignac number, because 13138110882053 - 24 = 13138110882037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13138110881995 and 13138110882013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13138110882023) 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, 6569055441026 + 6569055441027.
It is an arithmetic number, because the mean of its divisors is an integer number (6569055441027).
Almost surely, 213138110882053 is an apocalyptic number.
It is an amenable number.
13138110882053 is a deficient number, since it is larger than the sum of its proper divisors (1).
13138110882053 is an equidigital number, since it uses as much as digits as its factorization.
13138110882053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 138240, while the sum is 44.
The spelling of 13138110882053 in words is "thirteen trillion, one hundred thirty-eight billion, one hundred ten million, eight hundred eighty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •