Base | Representation |
---|---|
bin | 1010000000010110010101… |
… | …0100111000111110000111 |
3 | 1102221200210100121111201112 |
4 | 2200011211110320332013 |
5 | 2420220233433020403 |
6 | 35221501332515235 |
7 | 2213542535330144 |
oct | 240054524707607 |
9 | 42850710544645 |
10 | 11001111220103 |
11 | 35615aa538034 |
12 | 1298109a7bb1b |
13 | 61a528702a44 |
14 | 2a0656d953cb |
15 | 14126e0099d8 |
hex | a0165538f87 |
11001111220103 has 4 divisors (see below), whose sum is σ = 11015342930088. Its totient is φ = 10986879510120.
The previous prime is 11001111220087. The next prime is 11001111220139. The reversal of 11001111220103 is 30102211110011.
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 11001111220103 - 24 = 11001111220087 is a prime.
It is a super-2 number, since 2×110011112201032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001111220193) 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, 7115853833 + ... + 7115855378.
It is an arithmetic number, because the mean of its divisors is an integer number (2753835732522).
Almost surely, 211001111220103 is an apocalyptic number.
11001111220103 is a deficient number, since it is larger than the sum of its proper divisors (14231709985).
11001111220103 is an equidigital number, since it uses as much as digits as its factorization.
11001111220103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14231709984.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 11001111220103 its reverse (30102211110011), we get a palindrome (41103322330114).
The spelling of 11001111220103 in words is "eleven trillion, one billion, one hundred eleven million, two hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •