Base | Representation |
---|---|
bin | 11001000010001100101011… |
… | …001011101000000101010011 |
3 | 112102211200001101202200201211 |
4 | 121002030223023220011103 |
5 | 103412403312020213021 |
6 | 1030100131342240551 |
7 | 32122423300530643 |
oct | 3102145313500523 |
9 | 472750041680654 |
10 | 110102211101011 |
11 | 3209a0a38981a8 |
12 | 10422667886157 |
13 | 4958794bcb29c |
14 | 1d28d928cc523 |
15 | cae027b0d3e1 |
hex | 64232b2e8153 |
110102211101011 has 4 divisors (see below), whose sum is σ = 110678662468224. Its totient is φ = 109525759733800.
The previous prime is 110102211100969. The next prime is 110102211101027. The reversal of 110102211101011 is 110101112201011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 110102211101011 - 217 = 110102210969939 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110102211100982 and 110102211101000.
It is not an unprimeable number, because it can be changed into a prime (110102211101711) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 288225683320 + ... + 288225683701.
It is an arithmetic number, because the mean of its divisors is an integer number (27669665617056).
Almost surely, 2110102211101011 is an apocalyptic number.
110102211101011 is a deficient number, since it is larger than the sum of its proper divisors (576451367213).
110102211101011 is an equidigital number, since it uses as much as digits as its factorization.
110102211101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 576451367212.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 110102211101011 its reverse (110101112201011), we get a palindrome (220203323302022).
The spelling of 110102211101011 in words is "one hundred ten trillion, one hundred two billion, two hundred eleven million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.190 sec. • engine limits •