Base | Representation |
---|---|
bin | 11110111000010001000… |
… | …101100011001011100001 |
3 | 21111212020212022222121221 |
4 | 132320101011203023201 |
5 | 234231324112333323 |
6 | 4302500015215041 |
7 | 306211102513105 |
oct | 36702105431341 |
9 | 7455225288557 |
10 | 2122000511713 |
11 | 748a31a71a75 |
12 | 2a3311817481 |
13 | 125147044984 |
14 | 749c3785905 |
15 | 3a2e88e755d |
hex | 1ee111632e1 |
2122000511713 has 2 divisors, whose sum is σ = 2122000511714. Its totient is φ = 2122000511712.
The previous prime is 2122000511711. The next prime is 2122000511717. The reversal of 2122000511713 is 3171150002212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1339824770064 + 782175741649 = 1157508^2 + 884407^2 .
It is a cyclic number.
It is not a de Polignac number, because 2122000511713 - 21 = 2122000511711 is a prime.
Together with 2122000511711, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2122000511711) 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, 1061000255856 + 1061000255857.
It is an arithmetic number, because the mean of its divisors is an integer number (1061000255857).
Almost surely, 22122000511713 is an apocalyptic number.
It is an amenable number.
2122000511713 is a deficient number, since it is larger than the sum of its proper divisors (1).
2122000511713 is an equidigital number, since it uses as much as digits as its factorization.
2122000511713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 25.
Adding to 2122000511713 its reverse (3171150002212), we get a palindrome (5293150513925).
The spelling of 2122000511713 in words is "two trillion, one hundred twenty-two billion, five hundred eleven thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •