Base | Representation |
---|---|
bin | 111101001001101011… |
… | …1000111111001101110 |
3 | 110112222000020211102111 |
4 | 1322103113013321232 |
5 | 4122421230100220 |
6 | 140154515514234 |
7 | 12326156620141 |
oct | 1722327077156 |
9 | 415860224374 |
10 | 131321331310 |
11 | 50769516984 |
12 | 2154b2b897a |
13 | c4ca86ab90 |
14 | 64dab80058 |
15 | 3638d6915a |
hex | 1e935c7e6e |
131321331310 has 64 divisors (see below), whose sum is σ = 259622133120. Its totient is φ = 47529377280.
The previous prime is 131321331289. The next prime is 131321331319. The reversal of 131321331310 is 13133123131.
It is a super-2 number, since 2×1313213313102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131321331319) 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 31 ways as a sum of consecutive naturals, for example, 2295231 + ... + 2351749.
It is an arithmetic number, because the mean of its divisors is an integer number (4056595830).
Almost surely, 2131321331310 is an apocalyptic number.
131321331310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
131321331310 is a deficient number, since it is larger than the sum of its proper divisors (128300801810).
131321331310 is a wasteful number, since it uses less digits than its factorization.
131321331310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56893.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 131321331310 its reverse (13133123131), we get a palindrome (144454454441).
The spelling of 131321331310 in words is "one hundred thirty-one billion, three hundred twenty-one million, three hundred thirty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •