Base | Representation |
---|---|
bin | 11001000010001010101101… |
… | …111101010101010010011011 |
3 | 112102211110121222112222002202 |
4 | 121002022231331111102123 |
5 | 103412340011202431021 |
6 | 1030055143052520415 |
7 | 32122320240300656 |
oct | 3102125575252233 |
9 | 472743558488082 |
10 | 110100110202011 |
11 | 320992159a5736 |
12 | 1042218018010b |
13 | 495851b887197 |
14 | 1d28c3388a89d |
15 | cade53469a0b |
hex | 6422adf5549b |
110100110202011 has 4 divisors (see below), whose sum is σ = 112442665738272. Its totient is φ = 107757554665752.
The previous prime is 110100110201993. The next prime is 110100110202067. The reversal of 110100110202011 is 110202011001011.
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 110100110202011 - 26 = 110100110201947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110100110201983 and 110100110202001.
It is not an unprimeable number, because it can be changed into a prime (110100190202011) 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, 1171277768060 + ... + 1171277768153.
It is an arithmetic number, because the mean of its divisors is an integer number (28110666434568).
Almost surely, 2110100110202011 is an apocalyptic number.
110100110202011 is a deficient number, since it is larger than the sum of its proper divisors (2342555536261).
110100110202011 is an equidigital number, since it uses as much as digits as its factorization.
110100110202011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2342555536260.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 110100110202011 its reverse (110202011001011), we get a palindrome (220302121203022).
The spelling of 110100110202011 in words is "one hundred ten trillion, one hundred billion, one hundred ten million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •