Base | Representation |
---|---|
bin | 1010101011110101… |
… | …0101110001111001 |
3 | 21101220000222221021 |
4 | 2222331111301321 |
5 | 21333230103323 |
6 | 1152335342441 |
7 | 131035232461 |
oct | 25275256171 |
9 | 7356028837 |
10 | 2868206713 |
11 | 1242034179 |
12 | 680681a21 |
13 | 3692bb748 |
14 | 1d2cdaba1 |
15 | 11bc0e05d |
hex | aaf55c79 |
2868206713 has 2 divisors, whose sum is σ = 2868206714. Its totient is φ = 2868206712.
The previous prime is 2868206711. The next prime is 2868206723. The reversal of 2868206713 is 3176028682.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2690704384 + 177502329 = 51872^2 + 13323^2 .
It is a cyclic number.
It is not a de Polignac number, because 2868206713 - 21 = 2868206711 is a prime.
Together with 2868206711, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 2868206713.
It is not a weakly prime, because it can be changed into another prime (2868206711) 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, 1434103356 + 1434103357.
It is an arithmetic number, because the mean of its divisors is an integer number (1434103357).
Almost surely, 22868206713 is an apocalyptic number.
It is an amenable number.
2868206713 is a deficient number, since it is larger than the sum of its proper divisors (1).
2868206713 is an equidigital number, since it uses as much as digits as its factorization.
2868206713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 193536, while the sum is 43.
The square root of 2868206713 is about 53555.6412808212. The cubic root of 2868206713 is about 1420.8126527706.
The spelling of 2868206713 in words is "two billion, eight hundred sixty-eight million, two hundred six thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.172 sec. • engine limits •