Base | Representation |
---|---|
bin | 111100010001000011110110… |
… | …0001000101101001100101011 |
3 | 2120111222001100021120211112221 |
4 | 1320202013230020231030223 |
5 | 1023440311343323322214 |
6 | 5115241150541214511 |
7 | 216442130264035165 |
oct | 17042075410551453 |
9 | 2514861307524487 |
10 | 530110300214059 |
11 | 143a00574584224 |
12 | 4b556b16b61437 |
13 | 199a4257574196 |
14 | 94c9692817935 |
15 | 41445bad21e24 |
hex | 1e221ec22d32b |
530110300214059 has 2 divisors, whose sum is σ = 530110300214060. Its totient is φ = 530110300214058.
The previous prime is 530110300213997. The next prime is 530110300214063. The reversal of 530110300214059 is 950412003011035.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 530110300214059 - 219 = 530110299689771 is a prime.
It is a super-2 number, since 2×5301103002140592 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (530110300215059) 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, 265055150107029 + 265055150107030.
It is an arithmetic number, because the mean of its divisors is an integer number (265055150107030).
Almost surely, 2530110300214059 is an apocalyptic number.
530110300214059 is a deficient number, since it is larger than the sum of its proper divisors (1).
530110300214059 is an equidigital number, since it uses as much as digits as its factorization.
530110300214059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 34.
The spelling of 530110300214059 in words is "five hundred thirty trillion, one hundred ten billion, three hundred million, two hundred fourteen thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •