Base | Representation |
---|---|
bin | 1010100000010111… |
… | …0100000100111001 |
3 | 21021112111201212121 |
4 | 2220011310010321 |
5 | 21233421040223 |
6 | 1143500241241 |
7 | 126612265066 |
oct | 25005640471 |
9 | 7245451777 |
10 | 2820096313 |
11 | 1217964111 |
12 | 668540221 |
13 | 35c345458 |
14 | 1ca775c6d |
15 | 1178a915d |
hex | a8174139 |
2820096313 has 2 divisors, whose sum is σ = 2820096314. Its totient is φ = 2820096312.
The previous prime is 2820096311. The next prime is 2820096403. The reversal of 2820096313 is 3136900282.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2094709824 + 725386489 = 45768^2 + 26933^2 .
It is a cyclic number.
It is not a de Polignac number, because 2820096313 - 21 = 2820096311 is a prime.
Together with 2820096311, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2820096311) 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, 1410048156 + 1410048157.
It is an arithmetic number, because the mean of its divisors is an integer number (1410048157).
Almost surely, 22820096313 is an apocalyptic number.
It is an amenable number.
2820096313 is a deficient number, since it is larger than the sum of its proper divisors (1).
2820096313 is an equidigital number, since it uses as much as digits as its factorization.
2820096313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 34.
The square root of 2820096313 is about 53104.5790210223. The cubic root of 2820096313 is about 1412.8237283214.
Adding to 2820096313 its reverse (3136900282), we get a palindrome (5956996595).
The spelling of 2820096313 in words is "two billion, eight hundred twenty million, ninety-six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •