Base | Representation |
---|---|
bin | 100000000010001001110… |
… | …011111100111101000000 |
3 | 21210110000211211111121122 |
4 | 200002021303330331000 |
5 | 242031313322300102 |
6 | 4403140212211412 |
7 | 315020066524655 |
oct | 40021163747500 |
9 | 7713024744548 |
10 | 2201335353152 |
11 | 779643466631 |
12 | 2b6772909b68 |
13 | 12c77b418c30 |
14 | 7878c055c2c |
15 | 3c3dd7c70a2 |
hex | 20089cfcf40 |
2201335353152 has 28 divisors (see below), whose sum is σ = 4704295984836. Its totient is φ = 1016000931840.
The previous prime is 2201335353109. The next prime is 2201335353157. The reversal of 2201335353152 is 2513535331022.
It can be written as a sum of positive squares in 2 ways, for example, as 798778337536 + 1402557015616 = 893744^2 + 1184296^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201335353157) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 1322917049 + ... + 1322918712.
It is an arithmetic number, because the mean of its divisors is an integer number (168010570887).
Almost surely, 22201335353152 is an apocalyptic number.
It is an amenable number.
2201335353152 is an abundant number, since it is smaller than the sum of its proper divisors (2502960631684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201335353152 is a wasteful number, since it uses less digits than its factorization.
2201335353152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2645835786 (or 2645835776 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 35.
The spelling of 2201335353152 in words is "two trillion, two hundred one billion, three hundred thirty-five million, three hundred fifty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •