Base | Representation |
---|---|
bin | 111011101110101001010001… |
… | …1101110101010001101010101 |
3 | 2112220012212110021102220222122 |
4 | 1313131102203232222031111 |
5 | 1022330312402031333441 |
6 | 5101220220123505325 |
7 | 215443322155211411 |
oct | 16735224356521525 |
9 | 2486185407386878 |
10 | 525380326433621 |
11 | 1424475aa6a909a |
12 | 4ab12288388245 |
13 | 197201c94c6a79 |
14 | 93a4787431d41 |
15 | 40b153461434b |
hex | 1ddd4a3baa355 |
525380326433621 has 2 divisors, whose sum is σ = 525380326433622. Its totient is φ = 525380326433620.
The previous prime is 525380326433551. The next prime is 525380326433623. The reversal of 525380326433621 is 126334623083525.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 496616144032996 + 28764182400625 = 22284886^2 + 5363225^2 .
It is a cyclic number.
It is not a de Polignac number, because 525380326433621 - 222 = 525380322239317 is a prime.
Together with 525380326433623, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (525380326433623) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 262690163216810 + 262690163216811.
It is an arithmetic number, because the mean of its divisors is an integer number (262690163216811).
Almost surely, 2525380326433621 is an apocalyptic number.
It is an amenable number.
525380326433621 is a deficient number, since it is larger than the sum of its proper divisors (1).
525380326433621 is an equidigital number, since it uses as much as digits as its factorization.
525380326433621 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18662400, while the sum is 53.
The spelling of 525380326433621 in words is "five hundred twenty-five trillion, three hundred eighty billion, three hundred twenty-six million, four hundred thirty-three thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •