Base | Representation |
---|---|
bin | 100000000001001101111… |
… | …010011010110110111110 |
3 | 21210100102210212101101110 |
4 | 200001031322122312332 |
5 | 242022234041244200 |
6 | 4402452353022450 |
7 | 314653144640511 |
oct | 40011572326676 |
9 | 7710383771343 |
10 | 2200330415550 |
11 | 779178180093 |
12 | 2b6532254a26 |
13 | 12c64b1704b7 |
14 | 786d47c0d78 |
15 | 3c38046cb50 |
hex | 2004de9adbe |
2200330415550 has 48 divisors (see below), whose sum is σ = 5457988902960. Its totient is φ = 586629027840.
The previous prime is 2200330415509. The next prime is 2200330415551. The reversal of 2200330415550 is 555140330022.
2200330415550 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2200330415551) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 868585 + ... + 2270484.
It is an arithmetic number, because the mean of its divisors is an integer number (113708102145).
Almost surely, 22200330415550 is an apocalyptic number.
2200330415550 is an abundant number, since it is smaller than the sum of its proper divisors (3257658487410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2200330415550 is a wasteful number, since it uses less digits than its factorization.
2200330415550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3143757 (or 3143752 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 30.
Adding to 2200330415550 its reverse (555140330022), we get a palindrome (2755470745572).
The spelling of 2200330415550 in words is "two trillion, two hundred billion, three hundred thirty million, four hundred fifteen thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •