| Base | Representation |
|---|---|
| bin | 11101110011110001010100… |
| … | …101110011011011000000000 |
| 3 | 122012012010121022202220012010 |
| 4 | 131303301110232123120000 |
| 5 | 114140424323304400000 |
| 6 | 1142454545221332520 |
| 7 | 36420510034405401 |
| oct | 3563612456333000 |
| 9 | 565163538686163 |
| 10 | 131101003200000 |
| 11 | 38855694568229 |
| 12 | 12854304867140 |
| 13 | 581ca0514b012 |
| 14 | 24534729a79a8 |
| 15 | 102538815dd50 |
| hex | 773c54b9b600 |
131101003200000 has 480 divisors, whose sum is σ = 459525206004480. Its totient is φ = 33120230400000.
The previous prime is 131101003199983. The next prime is 131101003200017. The reversal of 131101003200000 is 2300101131.
It is an interprime number because it is at equal distance from previous prime (131101003199983) and next prime (131101003200017).
It is a tau number, because it is divible by the number of its divisors (480).
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 (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 90481245 + ... + 91918755.
It is an arithmetic number, because the mean of its divisors is an integer number (957344179176).
Almost surely, 2131101003200000 is an apocalyptic number.
131101003200000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 131101003200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (229762603002240).
131101003200000 is an abundant number, since it is smaller than the sum of its proper divisors (328424202804480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131101003200000 is an frugal number, since it uses more digits than its factorization.
131101003200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1437576 (or 1437540 counting only the distinct ones).
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 131101003200000 its reverse (2300101131), we get a palindrome (131103303301131).
The spelling of 131101003200000 in words is "one hundred thirty-one trillion, one hundred one billion, three million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •