Base | Representation |
---|---|
bin | 11000100101101100… |
… | …10101011101000011 |
3 | 1021002000021011101202 |
4 | 30102312111131003 |
5 | 204013442313202 |
6 | 10021534051415 |
7 | 645064541204 |
oct | 142266253503 |
9 | 37060234352 |
10 | 13201135427 |
11 | 5664773487 |
12 | 2685049b6b |
13 | 1324c65a4c |
14 | 8d33655ab |
15 | 523e32802 |
hex | 312d95743 |
13201135427 has 2 divisors, whose sum is σ = 13201135428. Its totient is φ = 13201135426.
The previous prime is 13201135421. The next prime is 13201135429. The reversal of 13201135427 is 72453110231.
13201135427 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13201135427 - 212 = 13201131331 is a prime.
Together with 13201135429, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13201135427.
It is not a weakly prime, because it can be changed into another prime (13201135421) 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, 6600567713 + 6600567714.
It is an arithmetic number, because the mean of its divisors is an integer number (6600567714).
Almost surely, 213201135427 is an apocalyptic number.
13201135427 is a deficient number, since it is larger than the sum of its proper divisors (1).
13201135427 is an equidigital number, since it uses as much as digits as its factorization.
13201135427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 29.
Adding to 13201135427 its reverse (72453110231), we get a palindrome (85654245658).
The spelling of 13201135427 in words is "thirteen billion, two hundred one million, one hundred thirty-five thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •