Base | Representation |
---|---|
bin | 11101110011111010101111… |
… | …010001101100111111001101 |
3 | 122012020002200211212222012021 |
4 | 131303322233101230333031 |
5 | 114141111024224044323 |
6 | 1142503340303210141 |
7 | 36421315405533220 |
oct | 3563725721547715 |
9 | 565202624788167 |
10 | 131111112331213 |
11 | 38859a01940123 |
12 | 128562662a6951 |
13 | 5820956628271 |
14 | 2453b514175b7 |
15 | 102577a8c705d |
hex | 773eaf46cfcd |
131111112331213 has 32 divisors (see below), whose sum is σ = 153043169610240. Its totient is φ = 109998529839360.
The previous prime is 131111112331201. The next prime is 131111112331217. The reversal of 131111112331213 is 312133211111131.
It is a cyclic number.
It is not a de Polignac number, because 131111112331213 - 25 = 131111112331181 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131111112331217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 97309056 + ... + 98647222.
It is an arithmetic number, because the mean of its divisors is an integer number (4782599050320).
Almost surely, 2131111112331213 is an apocalyptic number.
It is an amenable number.
131111112331213 is a deficient number, since it is larger than the sum of its proper divisors (21932057279027).
131111112331213 is a wasteful number, since it uses less digits than its factorization.
131111112331213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1339357.
The product of its digits is 324, while the sum is 25.
Adding to 131111112331213 its reverse (312133211111131), we get a palindrome (443244323442344).
The spelling of 131111112331213 in words is "one hundred thirty-one trillion, one hundred eleven billion, one hundred twelve million, three hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •