Base | Representation |
---|---|
bin | 1011111111000000111010… |
… | …0101011110001010111101 |
3 | 1201122201200000210010110111 |
4 | 2333300032211132022331 |
5 | 3211343403304234221 |
6 | 44005305113110021 |
7 | 2530010260025146 |
oct | 277601645361275 |
9 | 51581600703414 |
10 | 13177204368061 |
11 | 422046a378258 |
12 | 15899b70b8311 |
13 | 7477b3371986 |
14 | 337acc816acd |
15 | 17cb81719be1 |
hex | bfc0e95e2bd |
13177204368061 has 2 divisors, whose sum is σ = 13177204368062. Its totient is φ = 13177204368060.
The previous prime is 13177204368059. The next prime is 13177204368101. The reversal of 13177204368061 is 16086340277131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12844124176900 + 333080191161 = 3583870^2 + 577131^2 .
It is a cyclic number.
It is not a de Polignac number, because 13177204368061 - 21 = 13177204368059 is a prime.
Together with 13177204368059, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 13177204367996 and 13177204368014.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13177204368011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6588602184030 + 6588602184031.
It is an arithmetic number, because the mean of its divisors is an integer number (6588602184031).
Almost surely, 213177204368061 is an apocalyptic number.
It is an amenable number.
13177204368061 is a deficient number, since it is larger than the sum of its proper divisors (1).
13177204368061 is an equidigital number, since it uses as much as digits as its factorization.
13177204368061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1016064, while the sum is 49.
The spelling of 13177204368061 in words is "thirteen trillion, one hundred seventy-seven billion, two hundred four million, three hundred sixty-eight thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •