Base | Representation |
---|---|
bin | 101101111011111100001001… |
… | …110111111101001011100000 |
3 | 222111022222122222101121111122 |
4 | 231323330021313331023200 |
5 | 202440034224332100000 |
6 | 1553403453151431412 |
7 | 60361160540102603 |
oct | 5573741167751340 |
9 | 874288588347448 |
10 | 202031132300000 |
11 | 59411a16273993 |
12 | 1a7aaba1525568 |
13 | 88965b9667b33 |
14 | 37c650506833a |
15 | 18554602ac085 |
hex | b7bf09dfd2e0 |
202031132300000 has 144 divisors (see below), whose sum is σ = 513191408897664. Its totient is φ = 78205598400000.
The previous prime is 202031132299973. The next prime is 202031132300029. The reversal of 202031132300000 is 3231130202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 29485667 + ... + 35685666.
It is an arithmetic number, because the mean of its divisors is an integer number (3563829228456).
Almost surely, 2202031132300000 is an apocalyptic number.
202031132300000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202031132300000 is an abundant number, since it is smaller than the sum of its proper divisors (311160276597664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202031132300000 is an frugal number, since it uses more digits than its factorization.
202031132300000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65171399 (or 65171371 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 202031132300000 its reverse (3231130202), we get a palindrome (202034363430202).
The spelling of 202031132300000 in words is "two hundred two trillion, thirty-one billion, one hundred thirty-two million, three hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •