Base | Representation |
---|---|
bin | 11101110101100010111110… |
… | …010101000001100111111111 |
3 | 122012121210120212021100102212 |
4 | 131311202332111001213333 |
5 | 114144424233201310421 |
6 | 1143031010221211035 |
7 | 36432360053234111 |
oct | 3565427625014777 |
9 | 565553525240385 |
10 | 131223034010111 |
11 | 388a24157a300a |
12 | 12873aa0700a7b |
13 | 582b381ca9374 |
14 | 245932b9093b1 |
15 | 102862b560e5b |
hex | 7758be5419ff |
131223034010111 has 2 divisors, whose sum is σ = 131223034010112. Its totient is φ = 131223034010110.
The previous prime is 131223034010087. The next prime is 131223034010113. The reversal of 131223034010111 is 111010430322131.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-131223034010111 is a prime.
It is a Sophie Germain prime.
Together with 131223034010113, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131223034010113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65611517005055 + 65611517005056.
It is an arithmetic number, because the mean of its divisors is an integer number (65611517005056).
Almost surely, 2131223034010111 is an apocalyptic number.
131223034010111 is a deficient number, since it is larger than the sum of its proper divisors (1).
131223034010111 is an equidigital number, since it uses as much as digits as its factorization.
131223034010111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 131223034010111 its reverse (111010430322131), we get a palindrome (242233464332242).
The spelling of 131223034010111 in words is "one hundred thirty-one trillion, two hundred twenty-three billion, thirty-four million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •