Base | Representation |
---|---|
bin | 111101000110001010… |
… | …0100001111101110001 |
3 | 110112122202222200222200 |
4 | 1322030110201331301 |
5 | 4122201010223441 |
6 | 140135100053413 |
7 | 12323223615333 |
oct | 1721424417561 |
9 | 415582880880 |
10 | 131203211121 |
11 | 50708879494 |
12 | 21517834269 |
13 | c4ac251788 |
14 | 64c91d3453 |
15 | 362d7d57b6 |
hex | 1e8c521f71 |
131203211121 has 48 divisors (see below), whose sum is σ = 198086728320. Its totient is φ = 83605374720.
The previous prime is 131203211077. The next prime is 131203211141. The reversal of 131203211121 is 121112302131.
131203211121 is a `hidden beast` number, since 1 + 312 + 0 + 321 + 11 + 21 = 666.
It is not a de Polignac number, because 131203211121 - 29 = 131203210609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 131203211094 and 131203211103.
It is not an unprimeable number, because it can be changed into a prime (131203211141) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 6681165 + ... + 6700773.
It is an arithmetic number, because the mean of its divisors is an integer number (4126806840).
Almost surely, 2131203211121 is an apocalyptic number.
It is an amenable number.
131203211121 is a deficient number, since it is larger than the sum of its proper divisors (66883517199).
131203211121 is a wasteful number, since it uses less digits than its factorization.
131203211121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20006 (or 20003 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 131203211121 its reverse (121112302131), we get a palindrome (252315513252).
The spelling of 131203211121 in words is "one hundred thirty-one billion, two hundred three million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •