Base | Representation |
---|---|
bin | 111101011100101110… |
… | …0101011101110111000 |
3 | 110121121112121222020101 |
4 | 1322321130223232320 |
5 | 4130223320314000 |
6 | 140342143405144 |
7 | 12351046144522 |
oct | 1727134535670 |
9 | 417545558211 |
10 | 131960323000 |
11 | 50a67186890 |
12 | 216a92b37b4 |
13 | c5a006937c |
14 | 655b996a12 |
15 | 3674ed9e6a |
hex | 1eb972bbb8 |
131960323000 has 64 divisors (see below), whose sum is σ = 336858743520. Its totient is φ = 47985568000.
The previous prime is 131960322959. The next prime is 131960323007. The reversal of 131960323000 is 323069131.
It is a self number, because there is not a number n which added to its sum of digits gives 131960323000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131960323007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5987197 + ... + 6009196.
Almost surely, 2131960323000 is an apocalyptic number.
131960323000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131960323000 is an abundant number, since it is smaller than the sum of its proper divisors (204898420520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131960323000 is a wasteful number, since it uses less digits than its factorization.
131960323000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11996425 (or 11996411 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 28.
The spelling of 131960323000 in words is "one hundred thirty-one billion, nine hundred sixty million, three hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •