Base | Representation |
---|---|
bin | 111011101110111101001101… |
… | …1101000101100011101100101 |
3 | 2112220100221222001022222002112 |
4 | 1313131322123220230131211 |
5 | 1022332013042410401341 |
6 | 5101252020342050405 |
7 | 215446366141245665 |
oct | 16735723350543545 |
9 | 2486327861288075 |
10 | 525423140325221 |
11 | 14246377aa62586 |
12 | 4ab1a636719a05 |
13 | 1972426052b538 |
14 | 93a68895dc1a5 |
15 | 40b26dd17baeb |
hex | 1ddde9ba2c765 |
525423140325221 has 2 divisors, whose sum is σ = 525423140325222. Its totient is φ = 525423140325220.
The previous prime is 525423140325133. The next prime is 525423140325229. The reversal of 525423140325221 is 122523041324525.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 291718235817121 + 233704904508100 = 17079761^2 + 15287410^2 .
It is a cyclic number.
It is not a de Polignac number, because 525423140325221 - 218 = 525423140063077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (525423140325229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 262711570162610 + 262711570162611.
It is an arithmetic number, because the mean of its divisors is an integer number (262711570162611).
Almost surely, 2525423140325221 is an apocalyptic number.
It is an amenable number.
525423140325221 is a deficient number, since it is larger than the sum of its proper divisors (1).
525423140325221 is an equidigital number, since it uses as much as digits as its factorization.
525423140325221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576000, while the sum is 41.
Adding to 525423140325221 its reverse (122523041324525), we get a palindrome (647946181649746).
The spelling of 525423140325221 in words is "five hundred twenty-five trillion, four hundred twenty-three billion, one hundred forty million, three hundred twenty-five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •