Base | Representation |
---|---|
bin | 111101001001011001… |
… | …1111100111011011001 |
3 | 110112221100220101222102 |
4 | 1322102303330323121 |
5 | 4122411400030241 |
6 | 140153550133145 |
7 | 12326015346536 |
oct | 1722263747331 |
9 | 415840811872 |
10 | 131312111321 |
11 | 50764299856 |
12 | 215481b11b5 |
13 | c4c8990371 |
14 | 64d985dd8d |
15 | 363814739b |
hex | 1e92cfced9 |
131312111321 has 8 divisors (see below), whose sum is σ = 132527366400. Its totient is φ = 130097048400.
The previous prime is 131312111317. The next prime is 131312111339. The reversal of 131312111321 is 123111213131.
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 131312111321 - 22 = 131312111317 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 131312111293 and 131312111302.
It is not an unprimeable number, because it can be changed into a prime (131312111921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1578200 + ... + 1659318.
It is an arithmetic number, because the mean of its divisors is an integer number (16565920800).
Almost surely, 2131312111321 is an apocalyptic number.
It is an amenable number.
131312111321 is a deficient number, since it is larger than the sum of its proper divisors (1215255079).
131312111321 is a wasteful number, since it uses less digits than its factorization.
131312111321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96079.
The product of its digits is 108, while the sum is 20.
Adding to 131312111321 its reverse (123111213131), we get a palindrome (254423324452).
The spelling of 131312111321 in words is "one hundred thirty-one billion, three hundred twelve million, one hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •