Base | Representation |
---|---|
bin | 11001000001000000001101… |
… | …000110101001100001110111 |
3 | 112102112211010002012022202110 |
4 | 121001000031012221201313 |
5 | 103410032132114213421 |
6 | 1025554312005342103 |
7 | 32113455456536406 |
oct | 3101001506514167 |
9 | 472484102168673 |
10 | 110020102101111 |
11 | 320682994662a4 |
12 | 1040a771707933 |
13 | 4950b0ab77047 |
14 | 1d25003a0363d |
15 | cabd1e3eaa76 |
hex | 64100d1a9877 |
110020102101111 has 8 divisors (see below), whose sum is σ = 150658157832304. Its totient is φ = 71364390552000.
The previous prime is 110020102101061. The next prime is 110020102101139. The reversal of 110020102101111 is 111101201020011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110020102101111 - 226 = 110020034992247 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110020102106111) 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 7 ways as a sum of consecutive naturals, for example, 495586045390 + ... + 495586045611.
It is an arithmetic number, because the mean of its divisors is an integer number (18832269729038).
Almost surely, 2110020102101111 is an apocalyptic number.
110020102101111 is a deficient number, since it is larger than the sum of its proper divisors (40638055731193).
110020102101111 is an equidigital number, since it uses as much as digits as its factorization.
110020102101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 991172091041.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 110020102101111 its reverse (111101201020011), we get a palindrome (221121303121122).
The spelling of 110020102101111 in words is "one hundred ten trillion, twenty billion, one hundred two million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •