Base | Representation |
---|---|
bin | 1100011001001011101011… |
… | …1011101001100111101001 |
3 | 1210020201002012110120102111 |
4 | 3012102322323221213221 |
5 | 3241230112222241212 |
6 | 44552015225402321 |
7 | 2604334060542556 |
oct | 306227273514751 |
9 | 53221065416374 |
10 | 13626772462057 |
11 | 4384099895297 |
12 | 1640b626393a1 |
13 | 77accb119a41 |
14 | 351779bdba2d |
15 | 1896e4ae0ea7 |
hex | c64baee99e9 |
13626772462057 has 2 divisors, whose sum is σ = 13626772462058. Its totient is φ = 13626772462056.
The previous prime is 13626772462033. The next prime is 13626772462097. The reversal of 13626772462057 is 75026427762631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9603683238361 + 4023089223696 = 3098981^2 + 2005764^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13626772462057 is a prime.
It is a super-3 number, since 3×136267724620573 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13626772461992 and 13626772462010.
It is not a weakly prime, because it can be changed into another prime (13626772462007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6813386231028 + 6813386231029.
It is an arithmetic number, because the mean of its divisors is an integer number (6813386231029).
Almost surely, 213626772462057 is an apocalyptic number.
It is an amenable number.
13626772462057 is a deficient number, since it is larger than the sum of its proper divisors (1).
13626772462057 is an equidigital number, since it uses as much as digits as its factorization.
13626772462057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35562240, while the sum is 58.
The spelling of 13626772462057 in words is "thirteen trillion, six hundred twenty-six billion, seven hundred seventy-two million, four hundred sixty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •