Base | Representation |
---|---|
bin | 111101011101101001… |
… | …1001010101010100000 |
3 | 110121200201001222010012 |
4 | 1322323103022222200 |
5 | 4130304243221223 |
6 | 140345213224052 |
7 | 12351604145534 |
oct | 1727323125240 |
9 | 417621058105 |
10 | 131991382688 |
11 | 50a82770450 |
12 | 216b7792028 |
13 | c5a6622799 |
14 | 6561b5dbc4 |
15 | 3677ac2c78 |
hex | 1ebb4caaa0 |
131991382688 has 96 divisors (see below), whose sum is σ = 287278887168. Its totient is φ = 59196211200.
The previous prime is 131991382603. The next prime is 131991382723. The reversal of 131991382688 is 886283199131.
It is a super-2 number, since 2×1319913826882 (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 15 ways as a sum of consecutive naturals, for example, 11500793 + ... + 11512263.
It is an arithmetic number, because the mean of its divisors is an integer number (2992488408).
Almost surely, 2131991382688 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 131991382688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143639443584).
131991382688 is an abundant number, since it is smaller than the sum of its proper divisors (155287504480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131991382688 is a wasteful number, since it uses less digits than its factorization.
131991382688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11926 (or 11918 counting only the distinct ones).
The product of its digits is 4478976, while the sum is 59.
The spelling of 131991382688 in words is "one hundred thirty-one billion, nine hundred ninety-one million, three hundred eighty-two thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •