Base | Representation |
---|---|
bin | 100111101010100111001… |
… | …111101010100010011010 |
3 | 100122120210202010121121010 |
4 | 213222213033222202122 |
5 | 324124432140322010 |
6 | 5444115554554350 |
7 | 400635145426356 |
oct | 47524717524232 |
9 | 10576722117533 |
10 | 2725815167130 |
11 | 961014666650 |
12 | 380345b989b6 |
13 | 16a07409b123 |
14 | 95d044d4466 |
15 | 4ad885c8620 |
hex | 27aa73ea89a |
2725815167130 has 128 divisors (see below), whose sum is σ = 7332466498560. Its totient is φ = 642906224640.
The previous prime is 2725815167113. The next prime is 2725815167143. The reversal of 2725815167130 is 317615185272.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2725815167130.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1166937 + ... + 2610243.
It is an arithmetic number, because the mean of its divisors is an integer number (57284894520).
Almost surely, 22725815167130 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2725815167130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3666233249280).
2725815167130 is an abundant number, since it is smaller than the sum of its proper divisors (4606651331430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2725815167130 is a wasteful number, since it uses less digits than its factorization.
2725815167130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1443484.
The product of its (nonzero) digits is 705600, while the sum is 48.
The spelling of 2725815167130 in words is "two trillion, seven hundred twenty-five billion, eight hundred fifteen million, one hundred sixty-seven thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •