Base | Representation |
---|---|
bin | 111101001001111110… |
… | …0100011000000011000 |
3 | 110112222200201020200122 |
4 | 1322103330203000120 |
5 | 4122431233013111 |
6 | 140155510052412 |
7 | 12326336166551 |
oct | 1722374430030 |
9 | 415880636618 |
10 | 131331141656 |
11 | 50774007600 |
12 | 2155264a108 |
13 | c4cc8c4310 |
14 | 64dc1b5328 |
15 | 3639b55cdb |
hex | 1e93f23018 |
131331141656 has 96 divisors (see below), whose sum is σ = 292427546880. Its totient is φ = 54926277120.
The previous prime is 131331141649. The next prime is 131331141677. The reversal of 131331141656 is 656141133131.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3922121 + ... + 3955463.
It is an arithmetic number, because the mean of its divisors is an integer number (3046120280).
Almost surely, 2131331141656 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 131331141656, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146213773440).
131331141656 is an abundant number, since it is smaller than the sum of its proper divisors (161096405224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131331141656 is a wasteful number, since it uses less digits than its factorization.
131331141656 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33697 (or 33682 counting only the distinct ones).
The product of its digits is 19440, while the sum is 35.
Adding to 131331141656 its reverse (656141133131), we get a palindrome (787472274787).
The spelling of 131331141656 in words is "one hundred thirty-one billion, three hundred thirty-one million, one hundred forty-one thousand, six hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •