Base | Representation |
---|---|
bin | 100011010111011110000… |
… | …1100111100110100001101 |
3 | 122012200111002212212002121 |
4 | 1012232330030330310031 |
5 | 1114114321433220323 |
6 | 14201001014252541 |
7 | 1011115205144005 |
oct | 106567414746415 |
9 | 18180432785077 |
10 | 4860765523213 |
11 | 1604491466336 |
12 | 666070657151 |
13 | 2934a2ca35b2 |
14 | 12b395aab005 |
15 | 8668dd16a5d |
hex | 46bbc33cd0d |
4860765523213 has 2 divisors, whose sum is σ = 4860765523214. Its totient is φ = 4860765523212.
The previous prime is 4860765523199. The next prime is 4860765523217. The reversal of 4860765523213 is 3123255670684.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3883508718244 + 977256804969 = 1970662^2 + 988563^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4860765523213 is a prime.
It is a super-2 number, since 2×48607655232132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4860765523217) 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, 2430382761606 + 2430382761607.
It is an arithmetic number, because the mean of its divisors is an integer number (2430382761607).
Almost surely, 24860765523213 is an apocalyptic number.
It is an amenable number.
4860765523213 is a deficient number, since it is larger than the sum of its proper divisors (1).
4860765523213 is an equidigital number, since it uses as much as digits as its factorization.
4860765523213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7257600, while the sum is 52.
The spelling of 4860765523213 in words is "four trillion, eight hundred sixty billion, seven hundred sixty-five million, five hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •