Base | Representation |
---|---|
bin | 110011010100110110… |
… | …0001101000111110111 |
3 | 101112111111111000222101 |
4 | 1212221230031013313 |
5 | 3301213101314431 |
6 | 122345045042531 |
7 | 10651245030103 |
oct | 1465154150767 |
9 | 345444430871 |
10 | 110221119991 |
11 | 42820a48904 |
12 | 194409b6447 |
13 | a51726a338 |
14 | 5498702903 |
15 | 2d01724961 |
hex | 19a9b0d1f7 |
110221119991 has 2 divisors, whose sum is σ = 110221119992. Its totient is φ = 110221119990.
The previous prime is 110221119979. The next prime is 110221120063. The reversal of 110221119991 is 199911122011.
It is a weak prime.
It is an emirp because it is prime and its reverse (199911122011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110221119991 - 213 = 110221111799 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110221119991.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110221119941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55110559995 + 55110559996.
It is an arithmetic number, because the mean of its divisors is an integer number (55110559996).
Almost surely, 2110221119991 is an apocalyptic number.
110221119991 is a deficient number, since it is larger than the sum of its proper divisors (1).
110221119991 is an equidigital number, since it uses as much as digits as its factorization.
110221119991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2916, while the sum is 37.
The spelling of 110221119991 in words is "one hundred ten billion, two hundred twenty-one million, one hundred nineteen thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.971 sec. • engine limits •