Base | Representation |
---|---|
bin | 11000110001110110… |
… | …10101110111000101 |
3 | 1021100010011001201212 |
4 | 30120323111313011 |
5 | 204221044023414 |
6 | 10040015501205 |
7 | 650443402331 |
oct | 143073256705 |
9 | 37303131655 |
10 | 13303111109 |
11 | 5707294302 |
12 | 26b3227805 |
13 | 134011b8a2 |
14 | 902b0c7c1 |
15 | 52cd7783e |
hex | 318ed5dc5 |
13303111109 has 2 divisors, whose sum is σ = 13303111110. Its totient is φ = 13303111108.
The previous prime is 13303111067. The next prime is 13303111121. The reversal of 13303111109 is 90111130331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13076608609 + 226502500 = 114353^2 + 15050^2 .
It is a cyclic number.
It is not a de Polignac number, because 13303111109 - 228 = 13034675653 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13303111139) 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, 6651555554 + 6651555555.
It is an arithmetic number, because the mean of its divisors is an integer number (6651555555).
Almost surely, 213303111109 is an apocalyptic number.
It is an amenable number.
13303111109 is a deficient number, since it is larger than the sum of its proper divisors (1).
13303111109 is an equidigital number, since it uses as much as digits as its factorization.
13303111109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 23.
The spelling of 13303111109 in words is "thirteen billion, three hundred three million, one hundred eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •