Base | Representation |
---|---|
bin | 111101001001000011… |
… | …0001111110110011000 |
3 | 110112220112100200222012 |
4 | 1322102012033312120 |
5 | 4122400313131300 |
6 | 140152441245052 |
7 | 12325511456261 |
oct | 1722206176630 |
9 | 415815320865 |
10 | 131300130200 |
11 | 507585561a8 |
12 | 21544193788 |
13 | c4c6356b45 |
14 | 64d8021968 |
15 | 363707c435 |
hex | 1e9218fd98 |
131300130200 has 96 divisors (see below), whose sum is σ = 319991862960. Its totient is φ = 50047334400.
The previous prime is 131300130197. The next prime is 131300130223. The reversal of 131300130200 is 2031003131.
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 23 ways as a sum of consecutive naturals, for example, 166412 + ... + 538788.
Almost surely, 2131300130200 is an apocalyptic number.
131300130200 is a gapful number since it is divisible by the number (10) 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 131300130200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159995931480).
131300130200 is an abundant number, since it is smaller than the sum of its proper divisors (188691732760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131300130200 is a wasteful number, since it uses less digits than its factorization.
131300130200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 372477 (or 372468 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 131300130200 its reverse (2031003131), we get a palindrome (133331133331).
The spelling of 131300130200 in words is "one hundred thirty-one billion, three hundred million, one hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •