Base | Representation |
---|---|
bin | 111101000110111111… |
… | …0111101011111000111 |
3 | 110112201201111011120122 |
4 | 1322031332331133013 |
5 | 4122230131023421 |
6 | 140141534052155 |
7 | 12324013016402 |
oct | 1721576753707 |
9 | 415651434518 |
10 | 131231111111 |
11 | 507225a5131 |
12 | 2152504a05b |
13 | c4b4c6c949 |
14 | 64ccbb6d39 |
15 | 3630e972ab |
hex | 1e8dfbd7c7 |
131231111111 has 2 divisors, whose sum is σ = 131231111112. Its totient is φ = 131231111110.
The previous prime is 131231111051. The next prime is 131231111129. The reversal of 131231111111 is 111111132131.
It is a happy number.
It is a m-pointer prime, because the next prime (131231111129) can be obtained adding 131231111111 to its product of digits (18).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 131231111111 - 218 = 131230848967 is a prime.
131231111111 is a modest number, since divided by 1111111 gives 13123 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 131231111111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (131251111111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65615555555 + 65615555556.
It is an arithmetic number, because the mean of its divisors is an integer number (65615555556).
Almost surely, 2131231111111 is an apocalyptic number.
131231111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
131231111111 is an equidigital number, since it uses as much as digits as its factorization.
131231111111 is an evil number, because the sum of its binary digits is even.
The product of its digits is 18, while the sum is 17.
Adding to 131231111111 its reverse (111111132131), we get a palindrome (242342243242).
The spelling of 131231111111 in words is "one hundred thirty-one billion, two hundred thirty-one million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •