Base | Representation |
---|---|
bin | 101000000011100000110… |
… | …101001100110110001001 |
3 | 100202010211000112100012012 |
4 | 220003200311030312021 |
5 | 330044211041041243 |
6 | 5504300551025305 |
7 | 402602532261620 |
oct | 50034065146611 |
9 | 10663730470165 |
10 | 2752551112073 |
11 | 971394386814 |
12 | 38556796b235 |
13 | 16c745157aa9 |
14 | 9731d23c6b7 |
15 | 4b90089ed18 |
hex | 280e0d4cd89 |
2752551112073 has 8 divisors (see below), whose sum is σ = 3192724531392. Its totient is φ = 2324115650736.
The previous prime is 2752551112043. The next prime is 2752551112093. The reversal of 2752551112073 is 3702111552572.
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 2752551112073 - 26 = 2752551112009 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 2752551112073.
It is not an unprimeable number, because it can be changed into a prime (2752551112043) 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 7 ways as a sum of consecutive naturals, for example, 2934488990 + ... + 2934489927.
It is an arithmetic number, because the mean of its divisors is an integer number (399090566424).
Almost surely, 22752551112073 is an apocalyptic number.
It is an amenable number.
2752551112073 is a deficient number, since it is larger than the sum of its proper divisors (440173419319).
2752551112073 is an equidigital number, since it uses as much as digits as its factorization.
2752551112073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5868978991.
The product of its (nonzero) digits is 147000, while the sum is 41.
The spelling of 2752551112073 in words is "two trillion, seven hundred fifty-two billion, five hundred fifty-one million, one hundred twelve thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •