Base | Representation |
---|---|
bin | 100101011011011101100… |
… | …111011001010100001101 |
3 | 100002220001122222200102001 |
4 | 211123131213121110031 |
5 | 314120134241110203 |
6 | 5245335500232301 |
7 | 353554150546531 |
oct | 45333547312415 |
9 | 10086048880361 |
10 | 2572108535053 |
11 | 901909238a02 |
12 | 3565a9b3b691 |
13 | 158719915465 |
14 | 8c6c2757bc1 |
15 | 46d8e3c291d |
hex | 256dd9d950d |
2572108535053 has 2 divisors, whose sum is σ = 2572108535054. Its totient is φ = 2572108535052.
The previous prime is 2572108535021. The next prime is 2572108535159. The reversal of 2572108535053 is 3505358012752.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2553818136489 + 18290398564 = 1598067^2 + 135242^2 .
It is a cyclic number.
It is not a de Polignac number, because 2572108535053 - 25 = 2572108535021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2572108534994 and 2572108535012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2572108535753) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1286054267526 + 1286054267527.
It is an arithmetic number, because the mean of its divisors is an integer number (1286054267527).
Almost surely, 22572108535053 is an apocalyptic number.
It is an amenable number.
2572108535053 is a deficient number, since it is larger than the sum of its proper divisors (1).
2572108535053 is an equidigital number, since it uses as much as digits as its factorization.
2572108535053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260000, while the sum is 46.
The spelling of 2572108535053 in words is "two trillion, five hundred seventy-two billion, one hundred eight million, five hundred thirty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •