Base | Representation |
---|---|
bin | 111101010000101011… |
… | …0111101001101000100 |
3 | 110120120101010210111210 |
4 | 1322201112331031010 |
5 | 4123411334343031 |
6 | 140234105131420 |
7 | 12335040660543 |
oct | 1724126751504 |
9 | 416511123453 |
10 | 131556168516 |
11 | 5087a033613 |
12 | 215b5a89b70 |
13 | c537401ac6 |
14 | 652003015a |
15 | 364e7a5746 |
hex | 1ea15bd344 |
131556168516 has 96 divisors (see below), whose sum is σ = 336577248000. Its totient is φ = 39808032768.
The previous prime is 131556168509. The next prime is 131556168521. The reversal of 131556168516 is 615861655131.
It is a super-2 number, since 2×1315561685162 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 5958225 + ... + 5980263.
It is an arithmetic number, because the mean of its divisors is an integer number (3506013000).
Almost surely, 2131556168516 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 131556168516, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (168288624000).
131556168516 is an abundant number, since it is smaller than the sum of its proper divisors (205021079484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131556168516 is a wasteful number, since it uses less digits than its factorization.
131556168516 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23101 (or 23099 counting only the distinct ones).
The product of its digits is 648000, while the sum is 48.
The spelling of 131556168516 in words is "one hundred thirty-one billion, five hundred fifty-six million, one hundred sixty-eight thousand, five hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •