Base | Representation |
---|---|
bin | 1100011011100000010100… |
… | …0001101010101101011101 |
3 | 1210101112001202012122201221 |
4 | 3012320011001222231131 |
5 | 3242403320041242122 |
6 | 45022214233533341 |
7 | 2610245554324435 |
oct | 306700501525535 |
9 | 53345052178657 |
10 | 13666670259037 |
11 | 439a003087724 |
12 | 1648838274251 |
13 | 7819b8c66b33 |
14 | 3536829a32c5 |
15 | 18a77c63a6c7 |
hex | c6e0506ab5d |
13666670259037 has 2 divisors, whose sum is σ = 13666670259038. Its totient is φ = 13666670259036.
The previous prime is 13666670259017. The next prime is 13666670259049. The reversal of 13666670259037 is 73095207666631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9838441483641 + 3828228775396 = 3136629^2 + 1956586^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13666670259037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13666670259007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6833335129518 + 6833335129519.
It is an arithmetic number, because the mean of its divisors is an integer number (6833335129519).
Almost surely, 213666670259037 is an apocalyptic number.
It is an amenable number.
13666670259037 is a deficient number, since it is larger than the sum of its proper divisors (1).
13666670259037 is an equidigital number, since it uses as much as digits as its factorization.
13666670259037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51438240, while the sum is 61.
The spelling of 13666670259037 in words is "thirteen trillion, six hundred sixty-six billion, six hundred seventy million, two hundred fifty-nine thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •