Base | Representation |
---|---|
bin | 1010000001011101000100… |
… | …1101001100101010000111 |
3 | 1110000111210210020220010011 |
4 | 2200113101031030222013 |
5 | 2421023131324341403 |
6 | 35234321534011051 |
7 | 2215114243026211 |
oct | 240272115145207 |
9 | 43014723226104 |
10 | 11020101012103 |
11 | 3569664800907 |
12 | 129b929646a87 |
13 | 61c263a08061 |
14 | 2a15390335b1 |
15 | 1419d1229a6d |
hex | a05d134ca87 |
11020101012103 has 4 divisors (see below), whose sum is σ = 11100539705760. Its totient is φ = 10939662318448.
The previous prime is 11020101012091. The next prime is 11020101012121. The reversal of 11020101012103 is 30121010102011.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11020101012103 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 (11020101015103) 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 3 ways as a sum of consecutive naturals, for example, 40219346623 + ... + 40219346896.
It is an arithmetic number, because the mean of its divisors is an integer number (2775134926440).
Almost surely, 211020101012103 is an apocalyptic number.
11020101012103 is a deficient number, since it is larger than the sum of its proper divisors (80438693657).
11020101012103 is an equidigital number, since it uses as much as digits as its factorization.
11020101012103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80438693656.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11020101012103 its reverse (30121010102011), we get a palindrome (41141111114114).
The spelling of 11020101012103 in words is "eleven trillion, twenty billion, one hundred one million, twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •