Base | Representation |
---|---|
bin | 1010100010010100… |
… | …1001101100010001 |
3 | 21022002222002201212 |
4 | 2220211021230101 |
5 | 21243021430223 |
6 | 1144352305505 |
7 | 130042151402 |
oct | 25045115421 |
9 | 7262862655 |
10 | 2828311313 |
11 | 1221565173 |
12 | 66b242295 |
13 | 360c606b9 |
14 | 1cb8b39a9 |
15 | 11847d278 |
hex | a8949b11 |
2828311313 has 2 divisors, whose sum is σ = 2828311314. Its totient is φ = 2828311312.
The previous prime is 2828311307. The next prime is 2828311337. The reversal of 2828311313 is 3131138282.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1683707089 + 1144604224 = 41033^2 + 33832^2 .
It is a cyclic number.
It is not a de Polignac number, because 2828311313 - 214 = 2828294929 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2828311313.
It is not a weakly prime, because it can be changed into another prime (2828311363) 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, 1414155656 + 1414155657.
It is an arithmetic number, because the mean of its divisors is an integer number (1414155657).
Almost surely, 22828311313 is an apocalyptic number.
It is an amenable number.
2828311313 is a deficient number, since it is larger than the sum of its proper divisors (1).
2828311313 is an equidigital number, since it uses as much as digits as its factorization.
2828311313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6912, while the sum is 32.
The square root of 2828311313 is about 53181.8701532769. The cubic root of 2828311313 is about 1414.1942601519.
Adding to 2828311313 its reverse (3131138282), we get a palindrome (5959449595).
The spelling of 2828311313 in words is "two billion, eight hundred twenty-eight million, three hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •