Base | Representation |
---|---|
bin | 100100101111110110010… |
… | …001010001010000111101 |
3 | 22221102011221011212211012 |
4 | 210233312101101100331 |
5 | 312333232021300203 |
6 | 5212032501205005 |
7 | 350305505540633 |
oct | 44576621212075 |
9 | 8842157155735 |
10 | 2525277525053 |
11 | 893a67368a58 |
12 | 3494ba400765 |
13 | 15419557765a |
14 | 8a31cc5d353 |
15 | 45a4cd52bd8 |
hex | 24bf645143d |
2525277525053 has 2 divisors, whose sum is σ = 2525277525054. Its totient is φ = 2525277525052.
The previous prime is 2525277524953. The next prime is 2525277525061. The reversal of 2525277525053 is 3505257725252.
2525277525053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2147669733049 + 377607792004 = 1465493^2 + 614498^2 .
It is a cyclic number.
It is not a de Polignac number, because 2525277525053 - 212 = 2525277520957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2525277524992 and 2525277525010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2525277525083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1262638762526 + 1262638762527.
It is an arithmetic number, because the mean of its divisors is an integer number (1262638762527).
Almost surely, 22525277525053 is an apocalyptic number.
It is an amenable number.
2525277525053 is a deficient number, since it is larger than the sum of its proper divisors (1).
2525277525053 is an equidigital number, since it uses as much as digits as its factorization.
2525277525053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7350000, while the sum is 50.
The spelling of 2525277525053 in words is "two trillion, five hundred twenty-five billion, two hundred seventy-seven million, five hundred twenty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •