Base | Representation |
---|---|
bin | 111100010010101000011001… |
… | …0010101110001000001001101 |
3 | 2120112201200200112210222021201 |
4 | 1320211100302111301001031 |
5 | 1024002331102430020001 |
6 | 5115524301033025501 |
7 | 216463543162303066 |
oct | 17045206225610115 |
9 | 2515650615728251 |
10 | 530326226407501 |
11 | 143a840a925a267 |
12 | 4b590938255291 |
13 | 199bb719277254 |
14 | 94d5cd7b3756d |
15 | 414a00755d501 |
hex | 1e2543257104d |
530326226407501 has 2 divisors, whose sum is σ = 530326226407502. Its totient is φ = 530326226407500.
The previous prime is 530326226407387. The next prime is 530326226407511. The reversal of 530326226407501 is 105704622623035.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 281000515824900 + 249325710582601 = 16763070^2 + 15790051^2 .
It is a cyclic number.
It is not a de Polignac number, because 530326226407501 - 213 = 530326226399309 is a prime.
It is a super-2 number, since 2×5303262264075012 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (530326226407511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265163113203750 + 265163113203751.
It is an arithmetic number, because the mean of its divisors is an integer number (265163113203751).
Almost surely, 2530326226407501 is an apocalyptic number.
It is an amenable number.
530326226407501 is a deficient number, since it is larger than the sum of its proper divisors (1).
530326226407501 is an equidigital number, since it uses as much as digits as its factorization.
530326226407501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1814400, while the sum is 46.
The spelling of 530326226407501 in words is "five hundred thirty trillion, three hundred twenty-six billion, two hundred twenty-six million, four hundred seven thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.177 sec. • engine limits •