Base | Representation |
---|---|
bin | 10010110011101001011111… |
… | …100110010011000011000001 |
3 | 101211212101111201211201102211 |
4 | 102303221133212103003001 |
5 | 41320141421004431002 |
6 | 451530154201142121 |
7 | 23264616053030356 |
oct | 2263513746230301 |
9 | 354771451751384 |
10 | 82714084061377 |
11 | 2439a93411236a |
12 | 933a66348a941 |
13 | 371cb9b6c5242 |
14 | 165d55106462d |
15 | 9868b31a8dd7 |
hex | 4b3a5f9930c1 |
82714084061377 has 2 divisors, whose sum is σ = 82714084061378. Its totient is φ = 82714084061376.
The previous prime is 82714084061369. The next prime is 82714084061387. The reversal of 82714084061377 is 77316048041728.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48783505661361 + 33930578400016 = 6984519^2 + 5824996^2 .
It is a cyclic number.
It is not a de Polignac number, because 82714084061377 - 23 = 82714084061369 is a prime.
It is a super-2 number, since 2×827140840613772 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (82714084061387) 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, 41357042030688 + 41357042030689.
It is an arithmetic number, because the mean of its divisors is an integer number (41357042030689).
Almost surely, 282714084061377 is an apocalyptic number.
It is an amenable number.
82714084061377 is a deficient number, since it is larger than the sum of its proper divisors (1).
82714084061377 is an equidigital number, since it uses as much as digits as its factorization.
82714084061377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12644352, while the sum is 58.
The spelling of 82714084061377 in words is "eighty-two trillion, seven hundred fourteen billion, eighty-four million, sixty-one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •