Base | Representation |
---|---|
bin | 111101001101011010… |
… | …1111000001111000000 |
3 | 110120021202102000220102 |
4 | 1322122311320033000 |
5 | 4123200342142422 |
6 | 140215201501532 |
7 | 12332242440416 |
oct | 1723265701700 |
9 | 416252360812 |
10 | 131446834112 |
11 | 50823347000 |
12 | 215853418a8 |
13 | c51a8706a9 |
14 | 650d6cd2b6 |
15 | 3644daa192 |
hex | 1e9ad783c0 |
131446834112 has 168 divisors, whose sum is σ = 300023460912. Its totient is φ = 57131205120.
The previous prime is 131446834111. The next prime is 131446834219. The reversal of 131446834112 is 211438644131.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131446834111) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 45060878 + ... + 45063794.
It is an arithmetic number, because the mean of its divisors is an integer number (1785853934).
Almost surely, 2131446834112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 131446834112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150011730456).
131446834112 is an abundant number, since it is smaller than the sum of its proper divisors (168576626800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131446834112 is an equidigital number, since it uses as much as digits as its factorization.
131446834112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3008 (or 2953 counting only the distinct ones).
The product of its digits is 55296, while the sum is 38.
The spelling of 131446834112 in words is "one hundred thirty-one billion, four hundred forty-six million, eight hundred thirty-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •