Base | Representation |
---|---|
bin | 11111000001100101110… |
… | …001010011011100010000 |
3 | 21112211002112012202111201 |
4 | 133001211301103130100 |
5 | 234412324331433240 |
6 | 4311233223120544 |
7 | 310014140132026 |
oct | 37014561233420 |
9 | 7484075182451 |
10 | 2132011202320 |
11 | 7521a9818a9a |
12 | 2a52462a3154 |
13 | 12608100613c |
14 | 752930cc716 |
15 | 3a6d26b7d9a |
hex | 1f065c53710 |
2132011202320 has 40 divisors (see below), whose sum is σ = 4957761790080. Its totient is φ = 852660696960.
The previous prime is 2132011202291. The next prime is 2132011202333. The reversal of 2132011202320 is 232021102312.
It is a tau number, because it is divible by the number of its divisors (40).
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 7 ways as a sum of consecutive naturals, for example, 1768536 + ... + 2718775.
It is an arithmetic number, because the mean of its divisors is an integer number (123944044752).
Almost surely, 22132011202320 is an apocalyptic number.
2132011202320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2132011202320 is an abundant number, since it is smaller than the sum of its proper divisors (2825750587760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2132011202320 is a wasteful number, since it uses less digits than its factorization.
2132011202320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4493263 (or 4493257 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 2132011202320 its reverse (232021102312), we get a palindrome (2364032304632).
The spelling of 2132011202320 in words is "two trillion, one hundred thirty-two billion, eleven million, two hundred two thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •