Base | Representation |
---|---|
bin | 10010110010100100101101… |
… | …100101111000000101110011 |
3 | 101211121022212202121111121001 |
4 | 102302210231211320011303 |
5 | 41312434143021134011 |
6 | 451432221534142431 |
7 | 23256362645251054 |
oct | 2262445545700563 |
9 | 354538782544531 |
10 | 82640230646131 |
11 | 243715858563a4 |
12 | 9328292051a17 |
13 | 3715c2bb30732 |
14 | 1659b4677472b |
15 | 9849de62a7c1 |
hex | 4b292d978173 |
82640230646131 has 4 divisors (see below), whose sum is σ = 82727495938152. Its totient is φ = 82552965354112.
The previous prime is 82640230646111. The next prime is 82640230646137. The reversal of 82640230646131 is 13164603204628.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 82640230646131 - 215 = 82640230613363 is a prime.
It is a super-2 number, since 2×826402306461312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (82640230646137) 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 in 3 ways as a sum of consecutive naturals, for example, 43632644590 + ... + 43632646483.
It is an arithmetic number, because the mean of its divisors is an integer number (20681873984538).
Almost surely, 282640230646131 is an apocalyptic number.
82640230646131 is a deficient number, since it is larger than the sum of its proper divisors (87265292021).
82640230646131 is an equidigital number, since it uses as much as digits as its factorization.
82640230646131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87265292020.
The product of its (nonzero) digits is 995328, while the sum is 46.
The spelling of 82640230646131 in words is "eighty-two trillion, six hundred forty billion, two hundred thirty million, six hundred forty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •