Base | Representation |
---|---|
bin | 111011101110010010100001… |
… | …0011110101001000100011001 |
3 | 2112220001012022000012020010021 |
4 | 1313130211002132221010121 |
5 | 1022324012302223020231 |
6 | 5101141534144350441 |
7 | 215436642030134416 |
oct | 16734450236510431 |
9 | 2486035260166107 |
10 | 525331450204441 |
11 | 1424288a9306761 |
12 | 4ab04907915421 |
13 | 1971870a50b5ba |
14 | 93a226c06b10d |
15 | 40b012374d811 |
hex | 1ddc9427a9119 |
525331450204441 has 2 divisors, whose sum is σ = 525331450204442. Its totient is φ = 525331450204440.
The previous prime is 525331450204427. The next prime is 525331450204481. The reversal of 525331450204441 is 144402054133525.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 407949307040025 + 117382143164416 = 20197755^2 + 10834304^2 .
It is a cyclic number.
It is not a de Polignac number, because 525331450204441 - 217 = 525331450073369 is a prime.
It is a super-2 number, since 2×5253314502044412 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (525331450204481) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 262665725102220 + 262665725102221.
It is an arithmetic number, because the mean of its divisors is an integer number (262665725102221).
Almost surely, 2525331450204441 is an apocalyptic number.
It is an amenable number.
525331450204441 is a deficient number, since it is larger than the sum of its proper divisors (1).
525331450204441 is an equidigital number, since it uses as much as digits as its factorization.
525331450204441 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152000, while the sum is 43.
The spelling of 525331450204441 in words is "five hundred twenty-five trillion, three hundred thirty-one billion, four hundred fifty million, two hundred four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •