Base | Representation |
---|---|
bin | 1111011011100000000… |
… | …10010010101111010001 |
3 | 1212200102210202021221111 |
4 | 13231300002102233101 |
5 | 32141232110023031 |
6 | 1043315154053321 |
7 | 53205605654422 |
oct | 7556002225721 |
9 | 1780383667844 |
10 | 530160626641 |
11 | 194926941718 |
12 | 868b987a241 |
13 | 3acbc892909 |
14 | 1b934b21649 |
15 | dbcd8da1b1 |
hex | 7b70092bd1 |
530160626641 has 2 divisors, whose sum is σ = 530160626642. Its totient is φ = 530160626640.
The previous prime is 530160626563. The next prime is 530160626693. The reversal of 530160626641 is 146626061035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 332761691025 + 197398935616 = 576855^2 + 444296^2 .
It is a cyclic number.
It is not a de Polignac number, because 530160626641 - 215 = 530160593873 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 530160626594 and 530160626603.
It is not a weakly prime, because it can be changed into another prime (530160626741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265080313320 + 265080313321.
It is an arithmetic number, because the mean of its divisors is an integer number (265080313321).
Almost surely, 2530160626641 is an apocalyptic number.
It is an amenable number.
530160626641 is a deficient number, since it is larger than the sum of its proper divisors (1).
530160626641 is an equidigital number, since it uses as much as digits as its factorization.
530160626641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 155520, while the sum is 40.
Adding to 530160626641 its reverse (146626061035), we get a palindrome (676786687676).
The spelling of 530160626641 in words is "five hundred thirty billion, one hundred sixty million, six hundred twenty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •