Base | Representation |
---|---|
bin | 10011010111110001110… |
… | …001010100001010000101 |
3 | 11201021001200210010202211 |
4 | 103113301301110022011 |
5 | 133302244442144031 |
6 | 2455313444103421 |
7 | 165114255626320 |
oct | 23276161241205 |
9 | 4637050703684 |
10 | 1331201131141 |
11 | 473617374892 |
12 | 195bb4694b71 |
13 | 986bb28b80b |
14 | 486053397b7 |
15 | 2496320ebb1 |
hex | 135f1c54285 |
1331201131141 has 8 divisors (see below), whose sum is σ = 1521534696320. Its totient is φ = 1140908059728.
The previous prime is 1331201131129. The next prime is 1331201131157. The reversal of 1331201131141 is 1411311021331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1331201131141 - 229 = 1330664260229 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1331201131121) 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 7 ways as a sum of consecutive naturals, for example, 10052961 + ... + 10184518.
It is an arithmetic number, because the mean of its divisors is an integer number (190191837040).
Almost surely, 21331201131141 is an apocalyptic number.
It is an amenable number.
1331201131141 is a deficient number, since it is larger than the sum of its proper divisors (190333565179).
1331201131141 is an equidigital number, since it uses as much as digits as its factorization.
1331201131141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20246883.
The product of its (nonzero) digits is 216, while the sum is 22.
Adding to 1331201131141 its reverse (1411311021331), we get a palindrome (2742512152472).
The spelling of 1331201131141 in words is "one trillion, three hundred thirty-one billion, two hundred one million, one hundred thirty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •