Base | Representation |
---|---|
bin | 1100000000011111001110… |
… | …1100100011000110100001 |
3 | 1201202011000112100001000122 |
4 | 3000013303230203012201 |
5 | 3212302231344322314 |
6 | 44025053320130025 |
7 | 2531564554143524 |
oct | 300076354430641 |
9 | 51664015301018 |
10 | 13202523042209 |
11 | 4230182082946 |
12 | 15928a2306915 |
13 | 749cb9913a77 |
14 | 339011234bbb |
15 | 17d66438928e |
hex | c01f3b231a1 |
13202523042209 has 2 divisors, whose sum is σ = 13202523042210. Its totient is φ = 13202523042208.
The previous prime is 13202523042169. The next prime is 13202523042227. The reversal of 13202523042209 is 90224032520231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6890871752209 + 6311651290000 = 2625047^2 + 2512300^2 .
It is a cyclic number.
It is not a de Polignac number, because 13202523042209 - 216 = 13202522976673 is a prime.
It is a super-2 number, since 2×132025230422092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (13202523042229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6601261521104 + 6601261521105.
It is an arithmetic number, because the mean of its divisors is an integer number (6601261521105).
Almost surely, 213202523042209 is an apocalyptic number.
It is an amenable number.
13202523042209 is a deficient number, since it is larger than the sum of its proper divisors (1).
13202523042209 is an equidigital number, since it uses as much as digits as its factorization.
13202523042209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 35.
The spelling of 13202523042209 in words is "thirteen trillion, two hundred two billion, five hundred twenty-three million, forty-two thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •