Base | Representation |
---|---|
bin | 101000000110000111101… |
… | …010001101011000001101 |
3 | 100202102001002011212221101 |
4 | 220012013222031120031 |
5 | 330120424101310431 |
6 | 5505442413303101 |
7 | 403032066534025 |
oct | 50060752153015 |
9 | 10672032155841 |
10 | 2755350025741 |
11 | 9725a0292005 |
12 | 386009194a91 |
13 | 16ca9cc94721 |
14 | 97506c5ca85 |
15 | 4ba16472961 |
hex | 28187a8d60d |
2755350025741 has 2 divisors, whose sum is σ = 2755350025742. Its totient is φ = 2755350025740.
The previous prime is 2755350025723. The next prime is 2755350025759. The reversal of 2755350025741 is 1475200535572.
It is a balanced prime because it is at equal distance from previous prime (2755350025723) and next prime (2755350025759).
It can be written as a sum of positive squares in only one way, i.e., 1956165876900 + 799184148841 = 1398630^2 + 893971^2 .
It is a cyclic number.
It is not a de Polignac number, because 2755350025741 - 29 = 2755350025229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2755350025691 and 2755350025700.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2755350022741) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1377675012870 + 1377675012871.
It is an arithmetic number, because the mean of its divisors is an integer number (1377675012871).
Almost surely, 22755350025741 is an apocalyptic number.
It is an amenable number.
2755350025741 is a deficient number, since it is larger than the sum of its proper divisors (1).
2755350025741 is an equidigital number, since it uses as much as digits as its factorization.
2755350025741 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1470000, while the sum is 46.
The spelling of 2755350025741 in words is "two trillion, seven hundred fifty-five billion, three hundred fifty million, twenty-five thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •