Base | Representation |
---|---|
bin | 111101001010000010… |
… | …0000100010101111101 |
3 | 110112222211102102011021 |
4 | 1322110010010111331 |
5 | 4122432234110323 |
6 | 140200020224141 |
7 | 12326362020541 |
oct | 1722404042575 |
9 | 415884372137 |
10 | 131333113213 |
11 | 50775133895 |
12 | 2155323b051 |
13 | c500134813 |
14 | 64dc569a21 |
15 | 3639de505d |
hex | 1e9410457d |
131333113213 has 4 divisors (see below), whose sum is σ = 131632277920. Its totient is φ = 131033948508.
The previous prime is 131333113201. The next prime is 131333113229. The reversal of 131333113213 is 312311333131.
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.
It is a cyclic number.
It is not a de Polignac number, because 131333113213 - 213 = 131333105021 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 (131333113313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 149581695 + ... + 149582572.
It is an arithmetic number, because the mean of its divisors is an integer number (32908069480).
Almost surely, 2131333113213 is an apocalyptic number.
It is an amenable number.
131333113213 is a deficient number, since it is larger than the sum of its proper divisors (299164707).
131333113213 is an equidigital number, since it uses as much as digits as its factorization.
131333113213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299164706.
The product of its digits is 1458, while the sum is 25.
Adding to 131333113213 its reverse (312311333131), we get a palindrome (443644446344).
The spelling of 131333113213 in words is "one hundred thirty-one billion, three hundred thirty-three million, one hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •