Base | Representation |
---|---|
bin | 1100000110010110101001… |
… | …1010000010010111101101 |
3 | 1202002210010202221100211022 |
4 | 3001211222122002113231 |
5 | 3220430124011113221 |
6 | 44143241241103525 |
7 | 2542063102054214 |
oct | 301455232022755 |
9 | 52083122840738 |
10 | 13303298926061 |
11 | 4269996477a71 |
12 | 15aa327a87ba5 |
13 | 75665a0b1581 |
14 | 33dc5134407b |
15 | 1810b17854ab |
hex | c196a6825ed |
13303298926061 has 2 divisors, whose sum is σ = 13303298926062. Its totient is φ = 13303298926060.
The previous prime is 13303298926009. The next prime is 13303298926121. The reversal of 13303298926061 is 16062989230331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12094466844100 + 1208832081961 = 3477710^2 + 1099469^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13303298926061 is a prime.
It is a super-2 number, since 2×133032989260612 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13303298925994 and 13303298926012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13303298920061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6651649463030 + 6651649463031.
It is an arithmetic number, because the mean of its divisors is an integer number (6651649463031).
Almost surely, 213303298926061 is an apocalyptic number.
It is an amenable number.
13303298926061 is a deficient number, since it is larger than the sum of its proper divisors (1).
13303298926061 is an equidigital number, since it uses as much as digits as its factorization.
13303298926061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2519424, while the sum is 53.
The spelling of 13303298926061 in words is "thirteen trillion, three hundred three billion, two hundred ninety-eight million, nine hundred twenty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •