Base | Representation |
---|---|
bin | 100110010100111111… |
… | …0111111100110001101 |
3 | 21212110020110010102212 |
4 | 1030221332333212031 |
5 | 2322032020223101 |
6 | 101451230200205 |
7 | 5642454620126 |
oct | 1145176774615 |
9 | 255406403385 |
10 | 82308757901 |
11 | 319a816a067 |
12 | 13b51053065 |
13 | 79b9555356 |
14 | 3dab64704d |
15 | 221b0201bb |
hex | 1329fbf98d |
82308757901 has 2 divisors, whose sum is σ = 82308757902. Its totient is φ = 82308757900.
The previous prime is 82308757889. The next prime is 82308757903. The reversal of 82308757901 is 10975780328.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 47666242276 + 34642515625 = 218326^2 + 186125^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-82308757901 is a prime.
Together with 82308757903, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 82308757901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (82308757903) 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, 41154378950 + 41154378951.
It is an arithmetic number, because the mean of its divisors is an integer number (41154378951).
Almost surely, 282308757901 is an apocalyptic number.
It is an amenable number.
82308757901 is a deficient number, since it is larger than the sum of its proper divisors (1).
82308757901 is an equidigital number, since it uses as much as digits as its factorization.
82308757901 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 846720, while the sum is 50.
The spelling of 82308757901 in words is "eighty-two billion, three hundred eight million, seven hundred fifty-seven thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •