Base | Representation |
---|---|
bin | 111100010100001000101111… |
… | …0110101110011001001011101 |
3 | 2120120110110202010010021102021 |
4 | 1320220101132311303021131 |
5 | 1024014223323121320131 |
6 | 5120203320025500141 |
7 | 216514516400063326 |
oct | 17050213665631135 |
9 | 2516413663107367 |
10 | 530533131432541 |
11 | 1440539237a5a26 |
12 | 4b604a60341651 |
13 | 19a050a0cc7b53 |
14 | 9501d24cd144d |
15 | 41505b6cdae11 |
hex | 1e2845ed7325d |
530533131432541 has 2 divisors, whose sum is σ = 530533131432542. Its totient is φ = 530533131432540.
The previous prime is 530533131432431. The next prime is 530533131432569. The reversal of 530533131432541 is 145234131335035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 398435692409316 + 132097439023225 = 19960854^2 + 11493365^2 .
It is a cyclic number.
It is not a de Polignac number, because 530533131432541 - 27 = 530533131432413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530533131432571) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265266565716270 + 265266565716271.
It is an arithmetic number, because the mean of its divisors is an integer number (265266565716271).
Almost surely, 2530533131432541 is an apocalyptic number.
It is an amenable number.
530533131432541 is a deficient number, since it is larger than the sum of its proper divisors (1).
530533131432541 is an equidigital number, since it uses as much as digits as its factorization.
530533131432541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972000, while the sum is 43.
Adding to 530533131432541 its reverse (145234131335035), we get a palindrome (675767262767576).
The spelling of 530533131432541 in words is "five hundred thirty trillion, five hundred thirty-three billion, one hundred thirty-one million, four hundred thirty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •