Base | Representation |
---|---|
bin | 101000000110010011100… |
… | …110000111101101101001 |
3 | 100202102120000222212220021 |
4 | 220012103212013231221 |
5 | 330121331332434203 |
6 | 5505514325400441 |
7 | 403040050632220 |
oct | 50062346075551 |
9 | 10672500885807 |
10 | 2755550280553 |
11 | 972693329454 |
12 | 386064269121 |
13 | 16cb0260a9b5 |
14 | 975256a9cb7 |
15 | 4ba28d2c5bd |
hex | 28193987b69 |
2755550280553 has 4 divisors (see below), whose sum is σ = 3149200320640. Its totient is φ = 2361900240468.
The previous prime is 2755550280529. The next prime is 2755550280557. The reversal of 2755550280553 is 3550820555572.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2755550280553 - 25 = 2755550280521 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2755550280553.
It is not an unprimeable number, because it can be changed into a prime (2755550280557) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 196825020033 + ... + 196825020046.
It is an arithmetic number, because the mean of its divisors is an integer number (787300080160).
Almost surely, 22755550280553 is an apocalyptic number.
It is an amenable number.
2755550280553 is a deficient number, since it is larger than the sum of its proper divisors (393650040087).
2755550280553 is an equidigital number, since it uses as much as digits as its factorization.
2755550280553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 393650040086.
The product of its (nonzero) digits is 10500000, while the sum is 52.
The spelling of 2755550280553 in words is "two trillion, seven hundred fifty-five billion, five hundred fifty million, two hundred eighty thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •