Base | Representation |
---|---|
bin | 11001010110110011… |
… | …11101100000011101 |
3 | 1022010201111112120011 |
4 | 30223121331200131 |
5 | 210334430041314 |
6 | 10130452323221 |
7 | 661226450656 |
oct | 145331754035 |
9 | 38121445504 |
10 | 13613127709 |
11 | 585628a375 |
12 | 277b013511 |
13 | 138c41596c |
14 | 931d6c52d |
15 | 54a1b44c4 |
hex | 32b67d81d |
13613127709 has 2 divisors, whose sum is σ = 13613127710. Its totient is φ = 13613127708.
The previous prime is 13613127679. The next prime is 13613127811. The reversal of 13613127709 is 90772131631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11027100100 + 2586027609 = 105010^2 + 50853^2 .
It is an emirp because it is prime and its reverse (90772131631) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13613127709 - 211 = 13613125661 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13611127709) 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, 6806563854 + 6806563855.
It is an arithmetic number, because the mean of its divisors is an integer number (6806563855).
Almost surely, 213613127709 is an apocalyptic number.
It is an amenable number.
13613127709 is a deficient number, since it is larger than the sum of its proper divisors (1).
13613127709 is an equidigital number, since it uses as much as digits as its factorization.
13613127709 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 47628, while the sum is 40.
The spelling of 13613127709 in words is "thirteen billion, six hundred thirteen million, one hundred twenty-seven thousand, seven hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •