Base | Representation |
---|---|
bin | 111101010000110101… |
… | …0001101101010111000 |
3 | 110120120201122021022102 |
4 | 1322201222031222320 |
5 | 4123414132413241 |
6 | 140234405242532 |
7 | 12335131614350 |
oct | 1724152155270 |
9 | 416521567272 |
10 | 131561216696 |
11 | 50881971368 |
12 | 215b7703448 |
13 | c53847b7b0 |
14 | 6520985b60 |
15 | 364ee5139b |
hex | 1ea1a8dab8 |
131561216696 has 128 divisors (see below), whose sum is σ = 314166988800. Its totient is φ = 50243466240.
The previous prime is 131561216641. The next prime is 131561216711. The reversal of 131561216696 is 696612165131.
It is a self number, because there is not a number n which added to its sum of digits gives 131561216696.
It is a congruent number.
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, 9449036 + ... + 9462948.
It is an arithmetic number, because the mean of its divisors is an integer number (2454429600).
Almost surely, 2131561216696 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 131561216696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157083494400).
131561216696 is an abundant number, since it is smaller than the sum of its proper divisors (182605772104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131561216696 is a wasteful number, since it uses less digits than its factorization.
131561216696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14389 (or 14385 counting only the distinct ones).
The product of its digits is 349920, while the sum is 47.
The spelling of 131561216696 in words is "one hundred thirty-one billion, five hundred sixty-one million, two hundred sixteen thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •