Base | Representation |
---|---|
bin | 11101111000000000010… |
… | …101101011110000000001 |
3 | 21021021011002210102212100 |
4 | 131320000111223300001 |
5 | 232114021003123323 |
6 | 4211045112021013 |
7 | 301216153340202 |
oct | 35700025536001 |
9 | 7237132712770 |
10 | 2053000051713 |
11 | 72174400a116 |
12 | 291a75691769 |
13 | 11b79ba06010 |
14 | 715197db5a9 |
15 | 3860ae26943 |
hex | 1de0056bc01 |
2053000051713 has 96 divisors (see below), whose sum is σ = 3299277290400. Its totient is φ = 1222115328000.
The previous prime is 2053000051709. The next prime is 2053000051717. The reversal of 2053000051713 is 3171500003502.
It is an interprime number because it is at equal distance from previous prime (2053000051709) and next prime (2053000051717).
It can be written as a sum of positive squares in 16 ways, for example, as 857461184064 + 1195538867649 = 925992^2 + 1093407^2 .
It is not a de Polignac number, because 2053000051713 - 22 = 2053000051709 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2053000051717) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 458154433 + ... + 458158913.
It is an arithmetic number, because the mean of its divisors is an integer number (34367471775).
Almost surely, 22053000051713 is an apocalyptic number.
It is an amenable number.
2053000051713 is a deficient number, since it is larger than the sum of its proper divisors (1246277238687).
2053000051713 is a wasteful number, since it uses less digits than its factorization.
2053000051713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5331 (or 5328 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 27.
The spelling of 2053000051713 in words is "two trillion, fifty-three billion, fifty-one thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •