Base | Representation |
---|---|
bin | 1001001001111001011110… |
… | …00111111101001101000000 |
3 | 2122021112102001222000211110 |
4 | 10210330233013331031000 |
5 | 10114312401344044300 |
6 | 110452105334443320 |
7 | 4145303303306124 |
oct | 444745707751500 |
9 | 78245361860743 |
10 | 20131302331200 |
11 | 6461701386945 |
12 | 23116b8503540 |
13 | b304b1c2b638 |
14 | 4d8508693584 |
15 | 24d9dc1ea550 |
hex | 124f2f1fd340 |
20131302331200 has 168 divisors, whose sum is σ = 68919076271808. Its totient is φ = 5134940856320.
The previous prime is 20131302331181. The next prime is 20131302331229. The reversal of 20131302331200 is 213320313102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 91063977 + ... + 91284776.
It is an arithmetic number, because the mean of its divisors is an integer number (410232596856).
Almost surely, 220131302331200 is an apocalyptic number.
20131302331200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20131302331200 is an abundant number, since it is smaller than the sum of its proper divisors (48787773940608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20131302331200 is a wasteful number, since it uses less digits than its factorization.
20131302331200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182348801 (or 182348786 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 20131302331200 its reverse (213320313102), we get a palindrome (20344622644302).
The spelling of 20131302331200 in words is "twenty trillion, one hundred thirty-one billion, three hundred two million, three hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •