Base | Representation |
---|---|
bin | 101000000110110111100… |
… | …000000001110001001101 |
3 | 100202111010000111002102121 |
4 | 220012313200001301031 |
5 | 330124100040204432 |
6 | 5510054204452541 |
7 | 403061014043500 |
oct | 50066740016115 |
9 | 10674100432377 |
10 | 2756152663117 |
11 | 972972364387 |
12 | 3861b1b4a151 |
13 | 16cb9a35bb99 |
14 | 975816b3137 |
15 | 4ba61b6b197 |
hex | 281b7801c4d |
2756152663117 has 6 divisors (see below), whose sum is σ = 3206136771438. Its totient is φ = 2362416568344.
The previous prime is 2756152663111. The next prime is 2756152663127. The reversal of 2756152663117 is 7113662516572.
It can be written as a sum of positive squares in only one way, i.e., 2756044897956 + 107765161 = 1660134^2 + 10381^2 .
It is a de Polignac number, because none of the positive numbers 2k-2756152663117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2756152663111) 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 5 ways as a sum of consecutive naturals, for example, 28124006718 + ... + 28124006815.
It is an arithmetic number, because the mean of its divisors is an integer number (534356128573).
Almost surely, 22756152663117 is an apocalyptic number.
It is an amenable number.
2756152663117 is a deficient number, since it is larger than the sum of its proper divisors (449984108321).
2756152663117 is an equidigital number, since it uses as much as digits as its factorization.
2756152663117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56248013547 (or 56248013540 counting only the distinct ones).
The product of its digits is 3175200, while the sum is 52.
The spelling of 2756152663117 in words is "two trillion, seven hundred fifty-six billion, one hundred fifty-two million, six hundred sixty-three thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •