Base | Representation |
---|---|
bin | 1010000111000110… |
… | …0000110010011001 |
3 | 21000011002010112102 |
4 | 2201301200302121 |
5 | 21024303024004 |
6 | 1125152453145 |
7 | 124154364302 |
oct | 24161406231 |
9 | 7004063472 |
10 | 2714111129 |
11 | 1173054954 |
12 | 638b4a1b5 |
13 | 3433b7622 |
14 | 1ba6677a9 |
15 | 10d42111e |
hex | a1c60c99 |
2714111129 has 2 divisors, whose sum is σ = 2714111130. Its totient is φ = 2714111128.
The previous prime is 2714111117. The next prime is 2714111137. The reversal of 2714111129 is 9211114172.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2403646729 + 310464400 = 49027^2 + 17620^2 .
It is a cyclic number.
It is not a de Polignac number, because 2714111129 - 220 = 2713062553 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 (2714111629) 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, 1357055564 + 1357055565.
It is an arithmetic number, because the mean of its divisors is an integer number (1357055565).
Almost surely, 22714111129 is an apocalyptic number.
It is an amenable number.
2714111129 is a deficient number, since it is larger than the sum of its proper divisors (1).
2714111129 is an equidigital number, since it uses as much as digits as its factorization.
2714111129 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1008, while the sum is 29.
The square root of 2714111129 is about 52097.1316772814. The cubic root of 2714111129 is about 1394.8982902254.
The spelling of 2714111129 in words is "two billion, seven hundred fourteen million, one hundred eleven thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •