Base | Representation |
---|---|
bin | 110000101000110110… |
… | …101010110000111101 |
3 | 11222210122121021001012 |
4 | 300220312222300331 |
5 | 1323424101332013 |
6 | 35554123325005 |
7 | 3526120256216 |
oct | 605066526075 |
9 | 158718537035 |
10 | 52225027133 |
11 | 2016a736954 |
12 | a156080765 |
13 | 4c03a24a26 |
14 | 275604440d |
15 | 1559da71a8 |
hex | c28daac3d |
52225027133 has 2 divisors, whose sum is σ = 52225027134. Its totient is φ = 52225027132.
The previous prime is 52225027121. The next prime is 52225027171. The reversal of 52225027133 is 33172052225.
52225027133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 46258546084 + 5966481049 = 215078^2 + 77243^2 .
It is a cyclic number.
It is not a de Polignac number, because 52225027133 - 24 = 52225027117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 52225027133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (52225027033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 26112513566 + 26112513567.
It is an arithmetic number, because the mean of its divisors is an integer number (26112513567).
Almost surely, 252225027133 is an apocalyptic number.
It is an amenable number.
52225027133 is a deficient number, since it is larger than the sum of its proper divisors (1).
52225027133 is an equidigital number, since it uses as much as digits as its factorization.
52225027133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 25200, while the sum is 32.
Adding to 52225027133 its reverse (33172052225), we get a palindrome (85397079358).
The spelling of 52225027133 in words is "fifty-two billion, two hundred twenty-five million, twenty-seven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •