Base | Representation |
---|---|
bin | 101000000011100000111… |
… | …100100001001101100110 |
3 | 100202010211011010210210010 |
4 | 220003200330201031212 |
5 | 330044212033434002 |
6 | 5504301100111050 |
7 | 402602554501662 |
oct | 50034074411546 |
9 | 10663734123703 |
10 | 2752553030502 |
11 | 9713954770a0 |
12 | 385568535486 |
13 | 16c74567a062 |
14 | 9731d5bb8a2 |
15 | 4b900b2d46c |
hex | 280e0f21366 |
2752553030502 has 128 divisors (see below), whose sum is σ = 6325266640896. Its totient is φ = 790963200000.
The previous prime is 2752553030459. The next prime is 2752553030561. The reversal of 2752553030502 is 2050303552572.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 19976002 + ... + 20113322.
It is an arithmetic number, because the mean of its divisors is an integer number (49416145632).
Almost surely, 22752553030502 is an apocalyptic number.
2752553030502 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 2752553030502, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3162633320448).
2752553030502 is an abundant number, since it is smaller than the sum of its proper divisors (3572713610394).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2752553030502 is a wasteful number, since it uses less digits than its factorization.
2752553030502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137566.
The product of its (nonzero) digits is 315000, while the sum is 39.
The spelling of 2752553030502 in words is "two trillion, seven hundred fifty-two billion, five hundred fifty-three million, thirty thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •