Base | Representation |
---|---|
bin | 1100011001110111111111… |
… | …1101111100011101101001 |
3 | 1210021211210020020002012211 |
4 | 3012131333331330131221 |
5 | 3241423443014002143 |
6 | 45001303450405121 |
7 | 2605234624066135 |
oct | 306357775743551 |
9 | 53254706202184 |
10 | 13638668109673 |
11 | 4389143652422 |
12 | 16433224307a1 |
13 | 77c175775999 |
14 | 352187a143c5 |
15 | 189b8e0ec49d |
hex | c677ff7c769 |
13638668109673 has 2 divisors, whose sum is σ = 13638668109674. Its totient is φ = 13638668109672.
The previous prime is 13638668109667. The next prime is 13638668109721. The reversal of 13638668109673 is 37690186683631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11030581997824 + 2608086111849 = 3321232^2 + 1614957^2 .
It is a cyclic number.
It is not a de Polignac number, because 13638668109673 - 213 = 13638668101481 is a prime.
It is a super-2 number, since 2×136386681096732 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13638668109599 and 13638668109608.
It is not a weakly prime, because it can be changed into another prime (13638668109613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6819334054836 + 6819334054837.
It is an arithmetic number, because the mean of its divisors is an integer number (6819334054837).
Almost surely, 213638668109673 is an apocalyptic number.
It is an amenable number.
13638668109673 is a deficient number, since it is larger than the sum of its proper divisors (1).
13638668109673 is an equidigital number, since it uses as much as digits as its factorization.
13638668109673 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 141087744, while the sum is 67.
The spelling of 13638668109673 in words is "thirteen trillion, six hundred thirty-eight billion, six hundred sixty-eight million, one hundred nine thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •