Base | Representation |
---|---|
bin | 101000000011001011110… |
… | …010011000001101000001 |
3 | 100202002220102011221221021 |
4 | 220003023302120031001 |
5 | 330043000200110000 |
6 | 5504201535425441 |
7 | 402561014304142 |
oct | 50031362301501 |
9 | 10662812157837 |
10 | 2752198050625 |
11 | 9712230604a1 |
12 | 385489685281 |
13 | 16c6b9c6c2aa |
14 | 972c83b5ac9 |
15 | 4b8ce8ae11a |
hex | 280cbc98341 |
2752198050625 has 15 divisors (see below), whose sum is σ = 3439198511221. Its totient is φ = 2201725261000.
The previous prime is 2752198050617. The next prime is 2752198050661. The reversal of 2752198050625 is 5260508912572.
The square root of 2752198050625 is 1658975.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 215772327169 + 2536425723456 = 464513^2 + 1592616^2 .
It is not a de Polignac number, because 2752198050625 - 23 = 2752198050617 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 14 ways as a sum of consecutive naturals, for example, 41441196 + ... + 41507554.
Almost surely, 22752198050625 is an apocalyptic number.
2752198050625 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
2752198050625 is the 1658975-th square number.
2752198050625 is the 829488-th centered octagonal number.
It is an amenable number.
2752198050625 is a deficient number, since it is larger than the sum of its proper divisors (687000460596).
2752198050625 is an frugal number, since it uses more digits than its factorization.
2752198050625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 132738 (or 66364 counting only the distinct ones).
The product of its (nonzero) digits is 3024000, while the sum is 52.
The spelling of 2752198050625 in words is "two trillion, seven hundred fifty-two billion, one hundred ninety-eight million, fifty thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •