Base | Representation |
---|---|
bin | 100000000001011001111… |
… | …000111011001000100100 |
3 | 21210100221210221220201001 |
4 | 200001121320323020210 |
5 | 242023142011200202 |
6 | 4402524331443044 |
7 | 314661134566420 |
oct | 40013170731044 |
9 | 7710853856631 |
10 | 2200531350052 |
11 | 779270641162 |
12 | 2b65895b6484 |
13 | 12c680993c59 |
14 | 78713367b80 |
15 | 3c392e0dd87 |
hex | 20059e3b224 |
2200531350052 has 12 divisors (see below), whose sum is σ = 4401062700160. Its totient is φ = 943084864296.
The previous prime is 2200531350019. The next prime is 2200531350053. The reversal of 2200531350052 is 2500531350022.
2200531350052 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 78590405359 = 2200531350052 / (2 + 2 + 0 + 0 + 5 + 3 + 1 + 3 + 5 + 0 + 0 + 5 + 2).
It is a self number, because there is not a number n which added to its sum of digits gives 2200531350052.
It is not an unprimeable number, because it can be changed into a prime (2200531350053) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 39295202652 + ... + 39295202707.
Almost surely, 22200531350052 is an apocalyptic number.
It is an amenable number.
2200531350052 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2200531350052 is a wasteful number, since it uses less digits than its factorization.
2200531350052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78590405370 (or 78590405368 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 28.
The spelling of 2200531350052 in words is "two trillion, two hundred billion, five hundred thirty-one million, three hundred fifty thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.918 sec. • engine limits •