Base | Representation |
---|---|
bin | 10111101100010111101000… |
… | …01100101001000100010001 |
3 | 20211110220111110120012122111 |
4 | 23312023310030221010101 |
5 | 23312114444331130441 |
6 | 302451203525305321 |
7 | 13655151242655646 |
oct | 1366136414510421 |
9 | 224426443505574 |
10 | 52102050255121 |
11 | 156683a0086a99 |
12 | 5a15887265241 |
13 | 230c282488699 |
14 | cc1a77535dcd |
15 | 605461d65081 |
hex | 2f62f4329111 |
52102050255121 has 2 divisors, whose sum is σ = 52102050255122. Its totient is φ = 52102050255120.
The previous prime is 52102050255071. The next prime is 52102050255191. The reversal of 52102050255121 is 12155205020125.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 32404431015121 + 19697619240000 = 5692489^2 + 4438200^2 .
It is a cyclic number.
It is not a de Polignac number, because 52102050255121 - 223 = 52102041866513 is a prime.
It is a super-2 number, since 2×521020502551212 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (52102050255191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26051025127560 + 26051025127561.
It is an arithmetic number, because the mean of its divisors is an integer number (26051025127561).
Almost surely, 252102050255121 is an apocalyptic number.
It is an amenable number.
52102050255121 is a deficient number, since it is larger than the sum of its proper divisors (1).
52102050255121 is an equidigital number, since it uses as much as digits as its factorization.
52102050255121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10000, while the sum is 31.
Adding to 52102050255121 its reverse (12155205020125), we get a palindrome (64257255275246).
The spelling of 52102050255121 in words is "fifty-two trillion, one hundred two billion, fifty million, two hundred fifty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •