Base | Representation |
---|---|
bin | 111101001001011011… |
… | …1110011111111110001 |
3 | 110112221102210211011121 |
4 | 1322102313303333301 |
5 | 4122412124421223 |
6 | 140154023542241 |
7 | 12326030063131 |
oct | 1722267637761 |
9 | 415842724147 |
10 | 131313123313 |
11 | 50764920109 |
12 | 215485ba981 |
13 | c4c8c55b88 |
14 | 64d9a44ac1 |
15 | 363829715d |
hex | 1e92df3ff1 |
131313123313 has 4 divisors (see below), whose sum is σ = 137022389568. Its totient is φ = 125603857060.
The previous prime is 131313123299. The next prime is 131313123329. The reversal of 131313123313 is 313321313131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 313321313131 = 4523 ⋅69272897.
It is a cyclic number.
It is not a de Polignac number, because 131313123313 - 229 = 130776252401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131313123113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2854633093 + ... + 2854633138.
It is an arithmetic number, because the mean of its divisors is an integer number (34255597392).
Almost surely, 2131313123313 is an apocalyptic number.
It is an amenable number.
131313123313 is a deficient number, since it is larger than the sum of its proper divisors (5709266255).
131313123313 is an equidigital number, since it uses as much as digits as its factorization.
131313123313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5709266254.
The product of its digits is 1458, while the sum is 25.
Adding to 131313123313 its reverse (313321313131), we get a palindrome (444634436444).
The spelling of 131313123313 in words is "one hundred thirty-one billion, three hundred thirteen million, one hundred twenty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •