Base | Representation |
---|---|
bin | 110011010010001000… |
… | …1110010111101100011 |
3 | 101112021011121110110211 |
4 | 1212210101302331203 |
5 | 3301021324423021 |
6 | 122332042434551 |
7 | 10646063124640 |
oct | 1464421627543 |
9 | 345234543424 |
10 | 110130311011 |
11 | 42784764766 |
12 | 19416502a57 |
13 | a5014c4106 |
14 | 548a624dc7 |
15 | 2ce87883e1 |
hex | 19a4472f63 |
110130311011 has 32 divisors (see below), whose sum is σ = 129409007616. Its totient is φ = 91779156000.
The previous prime is 110130311009. The next prime is 110130311197. The reversal of 110130311011 is 110113031011.
It is not a de Polignac number, because 110130311011 - 21 = 110130311009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110130310982 and 110130311000.
It is not an unprimeable number, because it can be changed into a prime (110130311611) 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 in 31 ways as a sum of consecutive naturals, for example, 26027266 + ... + 26031496.
It is an arithmetic number, because the mean of its divisors is an integer number (4044031488).
Almost surely, 2110130311011 is an apocalyptic number.
110130311011 is a deficient number, since it is larger than the sum of its proper divisors (19278696605).
110130311011 is an equidigital number, since it uses as much as digits as its factorization.
110130311011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5023.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 110130311011 its reverse (110113031011), we get a palindrome (220243342022).
The spelling of 110130311011 in words is "one hundred ten billion, one hundred thirty million, three hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •