Base | Representation |
---|---|
bin | 1010001011111111010110… |
… | …1101100011101000011101 |
3 | 1110122211000001201220012011 |
4 | 2202333311231203220131 |
5 | 2432004324114213041 |
6 | 35453414255311221 |
7 | 2234152515634000 |
oct | 242776555435035 |
9 | 43584001656164 |
10 | 11201102101021 |
11 | 36293a713a9a8 |
12 | 130aa2251b511 |
13 | 63334ab7b2c1 |
14 | 2aa1c9b81537 |
15 | 14657677be81 |
hex | a2ff5b63a1d |
11201102101021 has 32 divisors (see below), whose sum is σ = 13163928940800. Its totient is φ = 9526420612800.
The previous prime is 11201102101019. The next prime is 11201102101171. The reversal of 11201102101021 is 12010120110211.
It is a happy number.
It is not a de Polignac number, because 11201102101021 - 21 = 11201102101019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11201102100992 and 11201102101010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11201102105021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 573200511 + ... + 573220051.
It is an arithmetic number, because the mean of its divisors is an integer number (411372779400).
Almost surely, 211201102101021 is an apocalyptic number.
It is an amenable number.
11201102101021 is a deficient number, since it is larger than the sum of its proper divisors (1962826839779).
11201102101021 is a wasteful number, since it uses less digits than its factorization.
11201102101021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32450 (or 32436 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11201102101021 its reverse (12010120110211), we get a palindrome (23211222211232).
The spelling of 11201102101021 in words is "eleven trillion, two hundred one billion, one hundred two million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •