Base | Representation |
---|---|
bin | 111100010010010101010111… |
… | …0110000101110101101110101 |
3 | 2120112120210012210022121222011 |
4 | 1320210222232300232231311 |
5 | 1024001143411212142111 |
6 | 5115453422213404221 |
7 | 216460565445134032 |
oct | 17044525660565565 |
9 | 2515523183277864 |
10 | 530285364177781 |
11 | 143a6883a627283 |
12 | 4b584a33639671 |
13 | 199b7906693cb4 |
14 | 94d3d3cc42389 |
15 | 4148e1500b021 |
hex | 1e24aaec2eb75 |
530285364177781 has 2 divisors, whose sum is σ = 530285364177782. Its totient is φ = 530285364177780.
The previous prime is 530285364177733. The next prime is 530285364177791. The reversal of 530285364177781 is 187771463582035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 515670295140625 + 14615069037156 = 22708375^2 + 3822966^2 .
It is a cyclic number.
It is not a de Polignac number, because 530285364177781 - 229 = 530284827306869 is a prime.
It is a super-2 number, since 2×5302853641777812 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530285364177731) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265142682088890 + 265142682088891.
It is an arithmetic number, because the mean of its divisors is an integer number (265142682088891).
Almost surely, 2530285364177781 is an apocalyptic number.
It is an amenable number.
530285364177781 is a deficient number, since it is larger than the sum of its proper divisors (1).
530285364177781 is an equidigital number, since it uses as much as digits as its factorization.
530285364177781 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 237081600, while the sum is 67.
The spelling of 530285364177781 in words is "five hundred thirty trillion, two hundred eighty-five billion, three hundred sixty-four million, one hundred seventy-seven thousand, seven hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •