Base | Representation |
---|---|
bin | 110011010001010011… |
… | …0010000101010101011 |
3 | 101112012012120021020012 |
4 | 1212202212100222223 |
5 | 3300442120334011 |
6 | 122325154322135 |
7 | 10645301405462 |
oct | 1464246205253 |
9 | 345165507205 |
10 | 110102121131 |
11 | 4276a860242 |
12 | 19408b8934b |
13 | a4c8704002 |
14 | 54869a79d9 |
15 | 2ce606aa8b |
hex | 19a2990aab |
110102121131 has 2 divisors, whose sum is σ = 110102121132. Its totient is φ = 110102121130.
The previous prime is 110102121097. The next prime is 110102121133. The reversal of 110102121131 is 131121201011.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110102121131 is a prime.
It is a super-2 number, since 2×1101021211312 (a number of 23 digits) contains 22 as substring.
Together with 110102121133, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (110102121133) 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, 55051060565 + 55051060566.
It is an arithmetic number, because the mean of its divisors is an integer number (55051060566).
Almost surely, 2110102121131 is an apocalyptic number.
110102121131 is a deficient number, since it is larger than the sum of its proper divisors (1).
110102121131 is an equidigital number, since it uses as much as digits as its factorization.
110102121131 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 110102121131 its reverse (131121201011), we get a palindrome (241223322142).
The spelling of 110102121131 in words is "one hundred ten billion, one hundred two million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •