Base | Representation |
---|---|
bin | 111110111011011… |
… | …0010001011110001 |
3 | 12110011011222202101 |
4 | 1331312302023301 |
5 | 13311021411304 |
6 | 545305020401 |
7 | 103216365352 |
oct | 17566621361 |
9 | 5404158671 |
10 | 2111513329 |
11 | 993992242 |
12 | 4ab184701 |
13 | 2785bc493 |
14 | 160605d29 |
15 | c558d8a4 |
hex | 7ddb22f1 |
2111513329 has 2 divisors, whose sum is σ = 2111513330. Its totient is φ = 2111513328.
The previous prime is 2111513293. The next prime is 2111513347. The reversal of 2111513329 is 9233151112.
Together with previous prime (2111513293) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1352400625 + 759112704 = 36775^2 + 27552^2 .
It is a cyclic number.
It is not a de Polignac number, because 2111513329 - 29 = 2111512817 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2111513297 and 2111513306.
It is not a weakly prime, because it can be changed into another prime (2111513389) 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, 1055756664 + 1055756665.
It is an arithmetic number, because the mean of its divisors is an integer number (1055756665).
Almost surely, 22111513329 is an apocalyptic number.
It is an amenable number.
2111513329 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111513329 is an equidigital number, since it uses as much as digits as its factorization.
2111513329 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1620, while the sum is 28.
The square root of 2111513329 is about 45951.2059580595. The cubic root of 2111513329 is about 1282.9151755679.
The spelling of 2111513329 in words is "two billion, one hundred eleven million, five hundred thirteen thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •