Base | Representation |
---|---|
bin | 100000000010001001100… |
… | …111111101100111000000 |
3 | 21210110000121220211011202 |
4 | 200002021213331213000 |
5 | 242031312021210422 |
6 | 4403140021000332 |
7 | 315020031024410 |
oct | 40021147754700 |
9 | 7713017824152 |
10 | 2201332210112 |
11 | 77964170a182 |
12 | 2b67718530a8 |
13 | 12c77a888449 |
14 | 7878b878640 |
15 | 3c3dd3a5b92 |
hex | 200899fd9c0 |
2201332210112 has 56 divisors (see below), whose sum is σ = 5043774158304. Its totient is φ = 933702008832.
The previous prime is 2201332210111. The next prime is 2201332210151. The reversal of 2201332210112 is 2110122331022.
It is a tau number, because it is divible by the number of its divisors (56).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2201332210111) 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 7 ways as a sum of consecutive naturals, for example, 25284833 + ... + 25371744.
It is an arithmetic number, because the mean of its divisors is an integer number (90067395684).
Almost surely, 22201332210112 is an apocalyptic number.
It is an amenable number.
2201332210112 is an abundant number, since it is smaller than the sum of its proper divisors (2842441948192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201332210112 is an equidigital number, since it uses as much as digits as its factorization.
2201332210112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50656693 (or 50656683 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2201332210112 its reverse (2110122331022), we get a palindrome (4311454541134).
The spelling of 2201332210112 in words is "two trillion, two hundred one billion, three hundred thirty-two million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •