Base | Representation |
---|---|
bin | 100101001001011010001… |
… | …001101111001110100000 |
3 | 100001001000122211022212010 |
4 | 211021122021233032200 |
5 | 313310434101413000 |
6 | 5232412122432520 |
7 | 352266600063306 |
oct | 45113211571640 |
9 | 10031018738763 |
10 | 2552723076000 |
11 | 8a4670699669 |
12 | 352899962740 |
13 | 15694a657b26 |
14 | 8b7a3d22276 |
15 | 46607597d50 |
hex | 2525a26f3a0 |
2552723076000 has 96 divisors (see below), whose sum is σ = 8362720836288. Its totient is φ = 680726150400.
The previous prime is 2552723075983. The next prime is 2552723076061. The reversal of 2552723076000 is 6703272552.
It is a tau number, because it is divible by the number of its divisors (96).
It is a self number, because there is not a number n which added to its sum of digits gives 2552723076000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 106351462 + ... + 106375461.
It is an arithmetic number, because the mean of its divisors is an integer number (87111675378).
Almost surely, 22552723076000 is an apocalyptic number.
2552723076000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2552723076000 is an abundant number, since it is smaller than the sum of its proper divisors (5809997760288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2552723076000 is a wasteful number, since it uses less digits than its factorization.
2552723076000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212726951 (or 212726933 counting only the distinct ones).
The product of its (nonzero) digits is 176400, while the sum is 39.
The spelling of 2552723076000 in words is "two trillion, five hundred fifty-two billion, seven hundred twenty-three million, seventy-six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •