Base | Representation |
---|---|
bin | 11001000010001011101001… |
… | …000000111101111101111011 |
3 | 112102211120012000221021020222 |
4 | 121002023221000331331323 |
5 | 103412344023324321221 |
6 | 1030055425245210255 |
7 | 32122353631111241 |
oct | 3102135100757573 |
9 | 472746160837228 |
10 | 110101101010811 |
11 | 32099684210a89 |
12 | 104223b7b6098b |
13 | 4958648c26991 |
14 | 1d28cc92c4791 |
15 | cadeb04329ab |
hex | 6422e903df7b |
110101101010811 has 2 divisors, whose sum is σ = 110101101010812. Its totient is φ = 110101101010810.
The previous prime is 110101101010807. The next prime is 110101101010853. The reversal of 110101101010811 is 118010101101011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110101101010811 - 22 = 110101101010807 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110101101010811.
It is not a weakly prime, because it can be changed into another prime (110101101010801) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050550505405 + 55050550505406.
It is an arithmetic number, because the mean of its divisors is an integer number (55050550505406).
Almost surely, 2110101101010811 is an apocalyptic number.
110101101010811 is a deficient number, since it is larger than the sum of its proper divisors (1).
110101101010811 is an equidigital number, since it uses as much as digits as its factorization.
110101101010811 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 17.
Adding to 110101101010811 its reverse (118010101101011), we get a palindrome (228111202111822).
The spelling of 110101101010811 in words is "one hundred ten trillion, one hundred one billion, one hundred one million, ten thousand, eight hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •