Base | Representation |
---|---|
bin | 101000000011000011010… |
… | …011000000110100000001 |
3 | 100202002112111011020222201 |
4 | 220003003103000310001 |
5 | 330042202214020000 |
6 | 5504135450433201 |
7 | 402554334502156 |
oct | 50030323006401 |
9 | 10662474136881 |
10 | 2752055610625 |
11 | 97115a712192 |
12 | 385449a32801 |
13 | 16c6965b9479 |
14 | 972b34d822d |
15 | 4b8c212496a |
hex | 280c34c0d01 |
2752055610625 has 20 divisors (see below), whose sum is σ = 3490296635056. Its totient is φ = 2168784090000.
The previous prime is 2752055610613. The next prime is 2752055610643. The reversal of 2752055610625 is 5260165502572.
2752055610625 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-2752055610625 is a prime.
It is a super-2 number, since 2×27520556106252 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 32818491 + ... + 32902240.
Almost surely, 22752055610625 is an apocalyptic number.
2752055610625 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2752055610625 is a deficient number, since it is larger than the sum of its proper divisors (738241024431).
2752055610625 is an frugal number, since it uses more digits than its factorization.
2752055610625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65720818 (or 65720803 counting only the distinct ones).
The product of its (nonzero) digits is 1260000, while the sum is 46.
The spelling of 2752055610625 in words is "two trillion, seven hundred fifty-two billion, fifty-five million, six hundred ten thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •