Base | Representation |
---|---|
bin | 1110111000110011100… |
… | …11110110010111010001 |
3 | 1210220100200201020222021 |
4 | 13130121303312113101 |
5 | 31340110214140031 |
6 | 1030555011411441 |
7 | 51646202240362 |
oct | 7343163662721 |
9 | 1726320636867 |
10 | 511534130641 |
11 | 187a38754576 |
12 | 8317b8b3b81 |
13 | 3931191a651 |
14 | 1aa89011b69 |
15 | d48d52d511 |
hex | 7719cf65d1 |
511534130641 has 2 divisors, whose sum is σ = 511534130642. Its totient is φ = 511534130640.
The previous prime is 511534130621. The next prime is 511534130687. The reversal of 511534130641 is 146031435115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 508552970641 + 2981160000 = 713129^2 + 54600^2 .
It is a cyclic number.
It is not a de Polignac number, because 511534130641 - 223 = 511525742033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 511534130597 and 511534130606.
It is not a weakly prime, because it can be changed into another prime (511534130621) 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, 255767065320 + 255767065321.
It is an arithmetic number, because the mean of its divisors is an integer number (255767065321).
Almost surely, 2511534130641 is an apocalyptic number.
It is an amenable number.
511534130641 is a deficient number, since it is larger than the sum of its proper divisors (1).
511534130641 is an equidigital number, since it uses as much as digits as its factorization.
511534130641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 21600, while the sum is 34.
Adding to 511534130641 its reverse (146031435115), we get a palindrome (657565565756).
The spelling of 511534130641 in words is "five hundred eleven billion, five hundred thirty-four million, one hundred thirty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •