Base | Representation |
---|---|
bin | 111100010100111010110000… |
… | …0000010111101000011100101 |
3 | 2120120211201221121122110121121 |
4 | 1320221311200002331003211 |
5 | 1024023003244103344423 |
6 | 5120324520420413541 |
7 | 216525340622353006 |
oct | 17051654002750345 |
9 | 2516751847573547 |
10 | 530640525840613 |
11 | 144095424081281 |
12 | 4b6218325472b1 |
13 | 19a12257744786 |
14 | 95071d20191ad |
15 | 41532a029b45d |
hex | 1e29d600bd0e5 |
530640525840613 has 2 divisors, whose sum is σ = 530640525840614. Its totient is φ = 530640525840612.
The previous prime is 530640525840571. The next prime is 530640525840617. The reversal of 530640525840613 is 316048525046035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 502122811161409 + 28517714679204 = 22408097^2 + 5340198^2 .
It is a cyclic number.
It is not a de Polignac number, because 530640525840613 - 213 = 530640525832421 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530640525840617) 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, 265320262920306 + 265320262920307.
It is an arithmetic number, because the mean of its divisors is an integer number (265320262920307).
Almost surely, 2530640525840613 is an apocalyptic number.
It is an amenable number.
530640525840613 is a deficient number, since it is larger than the sum of its proper divisors (1).
530640525840613 is an equidigital number, since it uses as much as digits as its factorization.
530640525840613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368000, while the sum is 52.
The spelling of 530640525840613 in words is "five hundred thirty trillion, six hundred forty billion, five hundred twenty-five million, eight hundred forty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •