Base | Representation |
---|---|
bin | 101000011000011100100… |
… | …010110111011001001101 |
3 | 100211021211110100010100110 |
4 | 220120130202313121031 |
5 | 330431224102300203 |
6 | 5522455151550233 |
7 | 404326526616402 |
oct | 50303442673115 |
9 | 10737743303313 |
10 | 2775027775053 |
11 | 97a97891a346 |
12 | 38999b22b379 |
13 | 1718b7980881 |
14 | 9845241c2a9 |
15 | 4c2b8c86d03 |
hex | 2861c8b764d |
2775027775053 has 8 divisors (see below), whose sum is σ = 3710699965728. Its totient is φ = 1844687050544.
The previous prime is 2775027775043. The next prime is 2775027775063. The reversal of 2775027775053 is 3505777205772.
It is an interprime number because it is at equal distance from previous prime (2775027775043) and next prime (2775027775063).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2775027775053 - 26 = 2775027774989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2775027774984 and 2775027775002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2775027775043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1332865326 + ... + 1332867407.
It is an arithmetic number, because the mean of its divisors is an integer number (463837495716).
Almost surely, 22775027775053 is an apocalyptic number.
It is an amenable number.
2775027775053 is a deficient number, since it is larger than the sum of its proper divisors (935672190675).
2775027775053 is a wasteful number, since it uses less digits than its factorization.
2775027775053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2665733083.
The product of its (nonzero) digits is 25210500, while the sum is 57.
The spelling of 2775027775053 in words is "two trillion, seven hundred seventy-five billion, twenty-seven million, seven hundred seventy-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •