Base | Representation |
---|---|
bin | 111011001000011001001101… |
… | …0100011011110000100001011 |
3 | 2112012121021201101122000211102 |
4 | 1312100302122203132010023 |
5 | 1021133144133412110201 |
6 | 5042113133553252015 |
7 | 214361441044324253 |
oct | 16620623243360413 |
9 | 2465537641560742 |
10 | 520123132535051 |
11 | 1407aaa88808971 |
12 | 4a40342086400b |
13 | 1942b529b3b906 |
14 | 9262145a86963 |
15 | 401e8e275d26b |
hex | 1d90c9a8de10b |
520123132535051 has 2 divisors, whose sum is σ = 520123132535052. Its totient is φ = 520123132535050.
The previous prime is 520123132535009. The next prime is 520123132535107. The reversal of 520123132535051 is 150535231321025.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-520123132535051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 520123132534996 and 520123132535014.
It is not a weakly prime, because it can be changed into another prime (520123132535351) 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, 260061566267525 + 260061566267526.
It is an arithmetic number, because the mean of its divisors is an integer number (260061566267526).
Almost surely, 2520123132535051 is an apocalyptic number.
520123132535051 is a deficient number, since it is larger than the sum of its proper divisors (1).
520123132535051 is an equidigital number, since it uses as much as digits as its factorization.
520123132535051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135000, while the sum is 38.
Adding to 520123132535051 its reverse (150535231321025), we get a palindrome (670658363856076).
The spelling of 520123132535051 in words is "five hundred twenty trillion, one hundred twenty-three billion, one hundred thirty-two million, five hundred thirty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •