Base | Representation |
---|---|
bin | 11000011010110110… |
… | …11101001101000001 |
3 | 1020211200011022211112 |
4 | 30031123131031001 |
5 | 203322203000301 |
6 | 10004525053105 |
7 | 642611613524 |
oct | 141533351501 |
9 | 36750138745 |
10 | 13110203201 |
11 | 5618405787 |
12 | 265a6b7195 |
13 | 130c1786b4 |
14 | 8c5254bbb |
15 | 51ae6e9bb |
hex | 30d6dd341 |
13110203201 has 2 divisors, whose sum is σ = 13110203202. Its totient is φ = 13110203200.
The previous prime is 13110203189. The next prime is 13110203219. The reversal of 13110203201 is 10230201131.
13110203201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9949065025 + 3161138176 = 99745^2 + 56224^2 .
It is a cyclic number.
It is not a de Polignac number, because 13110203201 - 210 = 13110202177 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (13110203231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6555101600 + 6555101601.
It is an arithmetic number, because the mean of its divisors is an integer number (6555101601).
Almost surely, 213110203201 is an apocalyptic number.
It is an amenable number.
13110203201 is a deficient number, since it is larger than the sum of its proper divisors (1).
13110203201 is an equidigital number, since it uses as much as digits as its factorization.
13110203201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 13110203201 its reverse (10230201131), we get a palindrome (23340404332).
The spelling of 13110203201 in words is "thirteen billion, one hundred ten million, two hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •