Base | Representation |
---|---|
bin | 10101010010001110… |
… | …00110111110110101 |
3 | 1002111101012020201122 |
4 | 22221013012332311 |
5 | 141400322211301 |
6 | 5125523233325 |
7 | 553114103264 |
oct | 125107067665 |
9 | 32441166648 |
10 | 11427147701 |
11 | 4934366222 |
12 | 226ab18845 |
13 | 1101582878 |
14 | 7a59005db |
15 | 46d31681b |
hex | 2a91c6fb5 |
11427147701 has 2 divisors, whose sum is σ = 11427147702. Its totient is φ = 11427147700.
The previous prime is 11427147691. The next prime is 11427147749. The reversal of 11427147701 is 10774172411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11417991025 + 9156676 = 106855^2 + 3026^2 .
It is a cyclic number.
It is not a de Polignac number, because 11427147701 - 210 = 11427146677 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11427147401) 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, 5713573850 + 5713573851.
It is an arithmetic number, because the mean of its divisors is an integer number (5713573851).
Almost surely, 211427147701 is an apocalyptic number.
It is an amenable number.
11427147701 is a deficient number, since it is larger than the sum of its proper divisors (1).
11427147701 is an equidigital number, since it uses as much as digits as its factorization.
11427147701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10976, while the sum is 35.
The spelling of 11427147701 in words is "eleven billion, four hundred twenty-seven million, one hundred forty-seven thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •