Base | Representation |
---|---|
bin | 111101001001101001… |
… | …0100011000111000000 |
3 | 110112221220222220022210 |
4 | 1322103102203013000 |
5 | 4122420423211112 |
6 | 140154434102120 |
7 | 12326143463535 |
oct | 1722322430700 |
9 | 415856886283 |
10 | 131320132032 |
11 | 50768877941 |
12 | 2154aa1a940 |
13 | c4ca53b04b |
14 | 64da94ad8c |
15 | 3638bcdb3c |
hex | 1e934a31c0 |
131320132032 has 112 divisors (see below), whose sum is σ = 351890380800. Its totient is φ = 43217667072.
The previous prime is 131320132007. The next prime is 131320132051. The reversal of 131320132032 is 230231023131.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4763793 + ... + 4791279.
It is an arithmetic number, because the mean of its divisors is an integer number (3141878400).
Almost surely, 2131320132032 is an apocalyptic number.
131320132032 is a gapful number since it is divisible by the number (12) 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 131320132032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (175945190400).
131320132032 is an abundant number, since it is smaller than the sum of its proper divisors (220570248768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131320132032 is a wasteful number, since it uses less digits than its factorization.
131320132032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27818 (or 27808 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 131320132032 its reverse (230231023131), we get a palindrome (361551155163).
The spelling of 131320132032 in words is "one hundred thirty-one billion, three hundred twenty million, one hundred thirty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •