Base | Representation |
---|---|
bin | 111101000011011000… |
… | …1101110101100010011 |
3 | 110112102021222100122021 |
4 | 1322012301232230103 |
5 | 4122003202432011 |
6 | 140121534352311 |
7 | 12321014221156 |
oct | 1720661565423 |
9 | 415367870567 |
10 | 131110202131 |
11 | 50670322457 |
12 | 214b065b697 |
13 | c495bb807c |
14 | 64bab01c9d |
15 | 3625562471 |
hex | 1e86c6eb13 |
131110202131 has 4 divisors (see below), whose sum is σ = 131112275632. Its totient is φ = 131108128632.
The previous prime is 131110202071. The next prime is 131110202173. The reversal of 131110202131 is 131202011131.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131202011131 = 439 ⋅298865629.
It is a cyclic number.
It is not a de Polignac number, because 131110202131 - 29 = 131110201619 is a prime.
It is a super-2 number, since 2×1311102021312 (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 (131110202231) 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, 938820 + ... + 1069393.
It is an arithmetic number, because the mean of its divisors is an integer number (32778068908).
Almost surely, 2131110202131 is an apocalyptic number.
131110202131 is a deficient number, since it is larger than the sum of its proper divisors (2073501).
131110202131 is an equidigital number, since it uses as much as digits as its factorization.
131110202131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2073500.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 131110202131 its reverse (131202011131), we get a palindrome (262312213262).
The spelling of 131110202131 in words is "one hundred thirty-one billion, one hundred ten million, two hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •