Base | Representation |
---|---|
bin | 111101000011011000… |
… | …1011000111101101011 |
3 | 110112102021210211112222 |
4 | 1322012301120331223 |
5 | 4122003142110011 |
6 | 140121532424255 |
7 | 12321013400534 |
oct | 1720661307553 |
9 | 415367724488 |
10 | 131110113131 |
11 | 506702715a8 |
12 | 214b061808b |
13 | c495b866ca |
14 | 64baabb68b |
15 | 3625545ddb |
hex | 1e86c58f6b |
131110113131 has 4 divisors (see below), whose sum is σ = 132906142152. Its totient is φ = 129314084112.
The previous prime is 131110113067. The next prime is 131110113133. The reversal of 131110113131 is 131311011131.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 131110113131 - 26 = 131110113067 is a prime.
It is a super-2 number, since 2×1311101131312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (131110113133) 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, 898014401 + ... + 898014546.
It is an arithmetic number, because the mean of its divisors is an integer number (33226535538).
Almost surely, 2131110113131 is an apocalyptic number.
131110113131 is a deficient number, since it is larger than the sum of its proper divisors (1796029021).
131110113131 is an equidigital number, since it uses as much as digits as its factorization.
131110113131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1796029020.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 131110113131 its reverse (131311011131), we get a palindrome (262421124262).
The spelling of 131110113131 in words is "one hundred thirty-one billion, one hundred ten million, one hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •