Base | Representation |
---|---|
bin | 11111000001110001000… |
… | …101101101001011100000 |
3 | 21112211120202112120011010 |
4 | 133001301011231023200 |
5 | 234413221440200000 |
6 | 4311304125220520 |
7 | 310021634212416 |
oct | 37016105551340 |
9 | 7484522476133 |
10 | 2132201100000 |
11 | 752296a30a24 |
12 | 2a5299a01740 |
13 | 1260b146412a |
14 | 752b04012b6 |
15 | 3a6e41c8d50 |
hex | 1f07116d2e0 |
2132201100000 has 144 divisors (see below), whose sum is σ = 6995838081456. Its totient is φ = 568586880000.
The previous prime is 2132201099947. The next prime is 2132201100017. The reversal of 2132201100000 is 11022312.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
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 23 ways as a sum of consecutive naturals, for example, 3253669 + ... + 3853668.
It is an arithmetic number, because the mean of its divisors is an integer number (48582208899).
Almost surely, 22132201100000 is an apocalyptic number.
2132201100000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2132201100000 is an abundant number, since it is smaller than the sum of its proper divisors (4863636981456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2132201100000 is an frugal number, since it uses more digits than its factorization.
2132201100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7107375 (or 7107347 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 2132201100000 its reverse (11022312), we get a palindrome (2132212122312).
The spelling of 2132201100000 in words is "two trillion, one hundred thirty-two billion, two hundred one million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •