Base | Representation |
---|---|
bin | 111101000001000111… |
… | …0110011000000000000 |
3 | 110112012222110122000000 |
4 | 1322002032303000000 |
5 | 4121324141421442 |
6 | 140110212000000 |
7 | 12316100035440 |
oct | 1720216630000 |
9 | 415188418000 |
10 | 131033935872 |
11 | 50631271494 |
12 | 2148b000000 |
13 | c4831642c8 |
14 | 64b092c120 |
15 | 361d9e9d4c |
hex | 1e823b3000 |
131033935872 has 364 divisors, whose sum is σ = 449070592080. Its totient is φ = 37432295424.
The previous prime is 131033935847. The next prime is 131033935883. The reversal of 131033935872 is 278539330131.
131033935872 is a `hidden beast` number, since 1 + 31 + 0 + 3 + 39 + 3 + 587 + 2 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 20898754 + ... + 20905022.
Almost surely, 2131033935872 is an apocalyptic number.
131033935872 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 131033935872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (224535296040).
131033935872 is an abundant number, since it is smaller than the sum of its proper divisors (318036656208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131033935872 is an frugal number, since it uses more digits than its factorization.
131033935872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6318 (or 6281 counting only the distinct ones).
The product of its (nonzero) digits is 408240, while the sum is 45.
The spelling of 131033935872 in words is "one hundred thirty-one billion, thirty-three million, nine hundred thirty-five thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •