Base | Representation |
---|---|
bin | 1111011100000000101… |
… | …01001010110011100011 |
3 | 1212201010212011121212122 |
4 | 13232000111022303203 |
5 | 32142312101312324 |
6 | 1043402241414455 |
7 | 53215435460432 |
oct | 7560025126343 |
9 | 1781125147778 |
10 | 530434010339 |
11 | 194a57196962 |
12 | 8697533a42b |
13 | 3b03440190c |
14 | 1b95d167119 |
15 | dbe78dca5e |
hex | 7b8054ace3 |
530434010339 has 2 divisors, whose sum is σ = 530434010340. Its totient is φ = 530434010338.
The previous prime is 530434010333. The next prime is 530434010357. The reversal of 530434010339 is 933010434035.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 530434010339 - 28 = 530434010083 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 530434010299 and 530434010308.
It is not a weakly prime, because it can be changed into another prime (530434010333) 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, 265217005169 + 265217005170.
It is an arithmetic number, because the mean of its divisors is an integer number (265217005170).
Almost surely, 2530434010339 is an apocalyptic number.
530434010339 is a deficient number, since it is larger than the sum of its proper divisors (1).
530434010339 is an equidigital number, since it uses as much as digits as its factorization.
530434010339 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 58320, while the sum is 35.
The spelling of 530434010339 in words is "five hundred thirty billion, four hundred thirty-four million, ten thousand, three hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •