Base | Representation |
---|---|
bin | 10010101110100011101110… |
… | …001001001010001001100001 |
3 | 101210121221121212022012012222 |
4 | 102232203232021022021201 |
5 | 41243424030242340434 |
6 | 451101344235000425 |
7 | 23230423562456543 |
oct | 2256435611121141 |
9 | 353557555265188 |
10 | 82364288246369 |
11 | 24275553534248 |
12 | 92a2901599115 |
13 | 36c5bc4217a4c |
14 | 164a64a783693 |
15 | 97c73e03972e |
hex | 4ae8ee24a261 |
82364288246369 has 2 divisors, whose sum is σ = 82364288246370. Its totient is φ = 82364288246368.
The previous prime is 82364288246287. The next prime is 82364288246371. The reversal of 82364288246369 is 96364288246328.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 64687645236769 + 17676643009600 = 8042863^2 + 4204360^2 .
It is a cyclic number.
It is not a de Polignac number, because 82364288246369 - 28 = 82364288246113 is a prime.
It is a super-2 number, since 2×823642882463692 (a number of 29 digits) contains 22 as substring.
Together with 82364288246371, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (82364288236369) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 41182144123184 + 41182144123185.
It is an arithmetic number, because the mean of its divisors is an integer number (41182144123185).
Almost surely, 282364288246369 is an apocalyptic number.
It is an amenable number.
82364288246369 is a deficient number, since it is larger than the sum of its proper divisors (1).
82364288246369 is an equidigital number, since it uses as much as digits as its factorization.
82364288246369 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1146617856, while the sum is 71.
The spelling of 82364288246369 in words is "eighty-two trillion, three hundred sixty-four billion, two hundred eighty-eight million, two hundred forty-six thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •