Base | Representation |
---|---|
bin | 101000000111001011101… |
… | …010001001000000111001 |
3 | 100202111222120212012100111 |
4 | 220013023222021000321 |
5 | 330130243124433203 |
6 | 5510151525304321 |
7 | 403102261464145 |
oct | 50071352110071 |
9 | 10674876765314 |
10 | 2756490858553 |
11 | 973026256643 |
12 | 3862872650a1 |
13 | 16cc22441023 |
14 | 975b458a225 |
15 | 4ba816c226d |
hex | 281cba89039 |
2756490858553 has 6 divisors (see below), whose sum is σ = 2822086099914. Its totient is φ = 2692386418176.
The previous prime is 2756490858523. The next prime is 2756490858577. The reversal of 2756490858553 is 3558580946572.
It can be written as a sum of positive squares in only one way, i.e., 2296716002064 + 459774856489 = 1515492^2 + 678067^2 .
It is not a de Polignac number, because 2756490858553 - 221 = 2756488761401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2756490858523) 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, 745398600 + ... + 745402297.
It is an arithmetic number, because the mean of its divisors is an integer number (470347683319).
Almost surely, 22756490858553 is an apocalyptic number.
It is an amenable number.
2756490858553 is a deficient number, since it is larger than the sum of its proper divisors (65595241361).
2756490858553 is an equidigital number, since it uses as much as digits as its factorization.
2756490858553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1490800983 (or 1490800940 counting only the distinct ones).
The product of its (nonzero) digits is 362880000, while the sum is 67.
The spelling of 2756490858553 in words is "two trillion, seven hundred fifty-six billion, four hundred ninety million, eight hundred fifty-eight thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •