Base | Representation |
---|---|
bin | 1011111111100111011111… |
… | …1110101000000000010001 |
3 | 1201200201101220102222000122 |
4 | 2333321313332220000101 |
5 | 3212031112000113314 |
6 | 44014141012000025 |
7 | 2530525043521622 |
oct | 277716776500021 |
9 | 51621356388018 |
10 | 13187562504209 |
11 | 42248a5264255 |
12 | 158ba08000015 |
13 | 748774303712 |
14 | 3383d2363a49 |
15 | 17d08ac6c28e |
hex | bfe77fa8011 |
13187562504209 has 2 divisors, whose sum is σ = 13187562504210. Its totient is φ = 13187562504208.
The previous prime is 13187562504199. The next prime is 13187562504223. The reversal of 13187562504209 is 90240526578131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7179318330625 + 6008244173584 = 2679425^2 + 2451172^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13187562504209 is a prime.
It is a super-2 number, since 2×131875625042092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13187582504209) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6593781252104 + 6593781252105.
It is an arithmetic number, because the mean of its divisors is an integer number (6593781252105).
It is a 1-persistent number, because it is pandigital, but 2⋅13187562504209 = 26375125008418 is not.
Almost surely, 213187562504209 is an apocalyptic number.
It is an amenable number.
13187562504209 is a deficient number, since it is larger than the sum of its proper divisors (1).
13187562504209 is an equidigital number, since it uses as much as digits as its factorization.
13187562504209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3628800, while the sum is 53.
The spelling of 13187562504209 in words is "thirteen trillion, one hundred eighty-seven billion, five hundred sixty-two million, five hundred four thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •