Base | Representation |
---|---|
bin | 11101110111000000000101… |
… | …100000000011001011100101 |
3 | 122012222100122112010020110101 |
4 | 131313000011200003023211 |
5 | 114203044012124031323 |
6 | 1143144543051424101 |
7 | 36442526445025654 |
oct | 3567000540031345 |
9 | 565870575106411 |
10 | 131323012330213 |
11 | 3893085a970740 |
12 | 1288b343155031 |
13 | 5837926167b62 |
14 | 24600d3b2519b |
15 | 102b02d916dad |
hex | 7770058032e5 |
131323012330213 has 8 divisors (see below), whose sum is σ = 143261557475616. Its totient is φ = 119384482098000.
The previous prime is 131323012330207. The next prime is 131323012330243. The reversal of 131323012330213 is 312033210323131.
It is a happy number.
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 131323012330213 - 233 = 131314422395621 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 (131323012330243) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23040063 + ... + 28168963.
It is an arithmetic number, because the mean of its divisors is an integer number (17907694684452).
Almost surely, 2131323012330213 is an apocalyptic number.
It is an amenable number.
131323012330213 is a deficient number, since it is larger than the sum of its proper divisors (11938545145403).
131323012330213 is a wasteful number, since it uses less digits than its factorization.
131323012330213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7456595.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 131323012330213 its reverse (312033210323131), we get a palindrome (443356222653344).
The spelling of 131323012330213 in words is "one hundred thirty-one trillion, three hundred twenty-three billion, twelve million, three hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •