Base | Representation |
---|---|
bin | 110111111011100100… |
… | …0000110000000111011 |
3 | 102111000200112220202012 |
4 | 1233313020012000323 |
5 | 3431441203224011 |
6 | 131102230400135 |
7 | 11451304643441 |
oct | 1576710060073 |
9 | 374020486665 |
10 | 120110211131 |
11 | 46a360a03a9 |
12 | 1b34080004b |
13 | b431c94861 |
14 | 5b55c34b91 |
15 | 31ce9c5a8b |
hex | 1bf720603b |
120110211131 has 2 divisors, whose sum is σ = 120110211132. Its totient is φ = 120110211130.
The previous prime is 120110211097. The next prime is 120110211157. The reversal of 120110211131 is 131112011021.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 120110211131 - 214 = 120110194747 is a prime.
It is a super-2 number, since 2×1201102111312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (120110211161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60055105565 + 60055105566.
It is an arithmetic number, because the mean of its divisors is an integer number (60055105566).
Almost surely, 2120110211131 is an apocalyptic number.
120110211131 is a deficient number, since it is larger than the sum of its proper divisors (1).
120110211131 is an equidigital number, since it uses as much as digits as its factorization.
120110211131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 120110211131 its reverse (131112011021), we get a palindrome (251222222152).
The spelling of 120110211131 in words is "one hundred twenty billion, one hundred ten million, two hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •