Base | Representation |
---|---|
bin | 11101110100010111100111… |
… | …100011001001101001001000 |
3 | 122012100001201220112201122102 |
4 | 131310113213203021221020 |
5 | 114142113031011401300 |
6 | 1142525505255012532 |
7 | 36423464005552115 |
oct | 3564274743115110 |
9 | 565301656481572 |
10 | 131142121200200 |
11 | 38871074605380 |
12 | 1286027b06a148 |
13 | 5823858a14356 |
14 | 245545383b90c |
15 | 1026492d850d5 |
hex | 7745e78c9a48 |
131142121200200 has 96 divisors (see below), whose sum is σ = 333759344909760. Its totient is φ = 47525286009600.
The previous prime is 131142121200191. The next prime is 131142121200271. The reversal of 131142121200200 is 2002121241131.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 101079044 + ... + 102368243.
It is an arithmetic number, because the mean of its divisors is an integer number (3476659842810).
Almost surely, 2131142121200200 is an apocalyptic number.
131142121200200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131142121200200 is an abundant number, since it is smaller than the sum of its proper divisors (202617223709560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131142121200200 is a wasteful number, since it uses less digits than its factorization.
131142121200200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 203447607 (or 203447598 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 131142121200200 its reverse (2002121241131), we get a palindrome (133144242441331).
The spelling of 131142121200200 in words is "one hundred thirty-one trillion, one hundred forty-two billion, one hundred twenty-one million, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •