Base | Representation |
---|---|
bin | 111100010010100011001010… |
… | …1110011000111010100101011 |
3 | 2120112200121201212102201122122 |
4 | 1320211012111303013110223 |
5 | 1024002140120044043111 |
6 | 5115515204041341455 |
7 | 216462665215524044 |
oct | 17045062563072453 |
9 | 2515617655381578 |
10 | 530315010143531 |
11 | 143a7a372a40118 |
12 | 4b58a727a9788b |
13 | 199ba64c5bc872 |
14 | 94d555224d8cb |
15 | 4149a9ca00cdb |
hex | 1e25195cc752b |
530315010143531 has 2 divisors, whose sum is σ = 530315010143532. Its totient is φ = 530315010143530.
The previous prime is 530315010143461. The next prime is 530315010143551. The reversal of 530315010143531 is 135341010513035.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 530315010143531 - 222 = 530315005949227 is a prime.
It is a super-2 number, since 2×5303150101435312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 530315010143491 and 530315010143500.
It is not a weakly prime, because it can be changed into another prime (530315010143551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265157505071765 + 265157505071766.
It is an arithmetic number, because the mean of its divisors is an integer number (265157505071766).
Almost surely, 2530315010143531 is an apocalyptic number.
530315010143531 is a deficient number, since it is larger than the sum of its proper divisors (1).
530315010143531 is an equidigital number, since it uses as much as digits as its factorization.
530315010143531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40500, while the sum is 35.
Adding to 530315010143531 its reverse (135341010513035), we get a palindrome (665656020656566).
The spelling of 530315010143531 in words is "five hundred thirty trillion, three hundred fifteen billion, ten million, one hundred forty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •