Base | Representation |
---|---|
bin | 101000110110001010100… |
… | …100011111110111100101 |
3 | 100221100012100221021110002 |
4 | 220312022210133313211 |
5 | 331442102221432223 |
6 | 5545253440511045 |
7 | 406536360211154 |
oct | 50661244376745 |
9 | 10840170837402 |
10 | 2806938467813 |
11 | 9924636520a7 |
12 | 39400601b485 |
13 | 174901b514ac |
14 | 99bdc51559b |
15 | 4d0354d1e28 |
hex | 28d8a91fde5 |
2806938467813 has 2 divisors, whose sum is σ = 2806938467814. Its totient is φ = 2806938467812.
The previous prime is 2806938467803. The next prime is 2806938467833. The reversal of 2806938467813 is 3187648396082.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1710178676644 + 1096759791169 = 1307738^2 + 1047263^2 .
It is a cyclic number.
It is not a de Polignac number, because 2806938467813 - 210 = 2806938466789 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2806938467813.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2806938467803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1403469233906 + 1403469233907.
It is an arithmetic number, because the mean of its divisors is an integer number (1403469233907).
Almost surely, 22806938467813 is an apocalyptic number.
It is an amenable number.
2806938467813 is a deficient number, since it is larger than the sum of its proper divisors (1).
2806938467813 is an equidigital number, since it uses as much as digits as its factorization.
2806938467813 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 83607552, while the sum is 65.
The spelling of 2806938467813 in words is "two trillion, eight hundred six billion, nine hundred thirty-eight million, four hundred sixty-seven thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •