Base | Representation |
---|---|
bin | 1011101010001100… |
… | …0001000101010001 |
3 | 22002010011100102101 |
4 | 2322203001011101 |
5 | 22402203213044 |
6 | 1234321120401 |
7 | 140362236136 |
oct | 27243010521 |
9 | 8063140371 |
10 | 3129741649 |
11 | 1366726251 |
12 | 734189101 |
13 | 3ab53c548 |
14 | 21993a58d |
15 | 134b70cd4 |
hex | ba8c1151 |
3129741649 has 2 divisors, whose sum is σ = 3129741650. Its totient is φ = 3129741648.
The previous prime is 3129741613. The next prime is 3129741661. The reversal of 3129741649 is 9461479213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3058643025 + 71098624 = 55305^2 + 8432^2 .
It is an emirp because it is prime and its reverse (9461479213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3129741649 - 211 = 3129739601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3129741599 and 3129741608.
It is not a weakly prime, because it can be changed into another prime (3129741449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1564870824 + 1564870825.
It is an arithmetic number, because the mean of its divisors is an integer number (1564870825).
Almost surely, 23129741649 is an apocalyptic number.
It is an amenable number.
3129741649 is a deficient number, since it is larger than the sum of its proper divisors (1).
3129741649 is an equidigital number, since it uses as much as digits as its factorization.
3129741649 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 326592, while the sum is 46.
The square root of 3129741649 is about 55944.0939599526. The cubic root of 3129741649 is about 1462.7479442678.
The spelling of 3129741649 in words is "three billion, one hundred twenty-nine million, seven hundred forty-one thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •