Base | Representation |
---|---|
bin | 11001000011101000111000… |
… | …000010010001100100001111 |
3 | 112110012010120212112200211012 |
4 | 121003220320002101210033 |
5 | 103421014040004013403 |
6 | 1030213423141515435 |
7 | 32132526512021165 |
oct | 3103507002214417 |
9 | 473163525480735 |
10 | 110201211001103 |
11 | 32128086741452 |
12 | 10439896712b7b |
13 | 4964c11467221 |
14 | 1d2daa4bb7235 |
15 | cb18be146ed8 |
hex | 643a3809190f |
110201211001103 has 2 divisors, whose sum is σ = 110201211001104. Its totient is φ = 110201211001102.
The previous prime is 110201211001087. The next prime is 110201211001153. The reversal of 110201211001103 is 301100112102011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110201211001103 - 24 = 110201211001087 is a prime.
It is a super-2 number, since 2×1102012110011032 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110201211001153) 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 as a sum of consecutive naturals, namely, 55100605500551 + 55100605500552.
It is an arithmetic number, because the mean of its divisors is an integer number (55100605500552).
Almost surely, 2110201211001103 is an apocalyptic number.
110201211001103 is a deficient number, since it is larger than the sum of its proper divisors (1).
110201211001103 is an equidigital number, since it uses as much as digits as its factorization.
110201211001103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 110201211001103 its reverse (301100112102011), we get a palindrome (411301323103114).
The spelling of 110201211001103 in words is "one hundred ten trillion, two hundred one billion, two hundred eleven million, one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •