Base | Representation |
---|---|
bin | 11001000011111011010011… |
… | …101010111111000111100111 |
3 | 112110021000200010211011200212 |
4 | 121003323103222333013213 |
5 | 103421330103003323421 |
6 | 1030230455043530035 |
7 | 32134130115565625 |
oct | 3103732352770747 |
9 | 473230603734625 |
10 | 110221002011111 |
11 | 321355121a8172 |
12 | 1044169a68991b |
13 | 4966a4675a934 |
14 | 1d30a2141a515 |
15 | cb217b87ee5b |
hex | 643ed3abf1e7 |
110221002011111 has 4 divisors (see below), whose sum is σ = 110221025257272. Its totient is φ = 110220978764952.
The previous prime is 110221002011083. The next prime is 110221002011173. The reversal of 110221002011111 is 111110200122011.
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 110221002011111 - 218 = 110221001748967 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 (110221002011311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1669685 + ... + 14940878.
It is an arithmetic number, because the mean of its divisors is an integer number (27555256314318).
Almost surely, 2110221002011111 is an apocalyptic number.
110221002011111 is a deficient number, since it is larger than the sum of its proper divisors (23246161).
110221002011111 is an equidigital number, since it uses as much as digits as its factorization.
110221002011111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23246160.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 110221002011111 its reverse (111110200122011), we get a palindrome (221331202133122).
The spelling of 110221002011111 in words is "one hundred ten trillion, two hundred twenty-one billion, two million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •