Base | Representation |
---|---|
bin | 110011010001100010… |
… | …0101100101010100011 |
3 | 101112012202120122100201 |
4 | 1212203010230222203 |
5 | 3301001141201011 |
6 | 122330041330031 |
7 | 10645426260043 |
oct | 1464304545243 |
9 | 345182518321 |
10 | 110110100131 |
11 | 4277430aa59 |
12 | 1940b796917 |
13 | a4ca268a05 |
14 | 5487a83723 |
15 | 2ce6ae4cc1 |
hex | 19a312caa3 |
110110100131 has 2 divisors, whose sum is σ = 110110100132. Its totient is φ = 110110100130.
The previous prime is 110110100119. The next prime is 110110100137. The reversal of 110110100131 is 131001011011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110110100131 - 25 = 110110100099 is a prime.
It is a super-2 number, since 2×1101101001312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110110100137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055050065 + 55055050066.
It is an arithmetic number, because the mean of its divisors is an integer number (55055050066).
Almost surely, 2110110100131 is an apocalyptic number.
110110100131 is a deficient number, since it is larger than the sum of its proper divisors (1).
110110100131 is an equidigital number, since it uses as much as digits as its factorization.
110110100131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 110110100131 its reverse (131001011011), we get a palindrome (241111111142).
The spelling of 110110100131 in words is "one hundred ten billion, one hundred ten million, one hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •