Base | Representation |
---|---|
bin | 1010000110001011001110… |
… | …1111101101000111100101 |
3 | 1110022021011111020022000011 |
4 | 2201202303233231013211 |
5 | 2423340240021320401 |
6 | 35335454225050221 |
7 | 2224015234413244 |
oct | 241426357550745 |
9 | 43267144208004 |
10 | 11101211120101 |
11 | 359aaa72a6513 |
12 | 12b35a5186971 |
13 | 626abbb1c5bb |
14 | 2a54313bc95b |
15 | 143b7bdc9451 |
hex | a18b3bed1e5 |
11101211120101 has 6 divisors (see below), whose sum is σ = 11716236667302. Its totient is φ = 10516936850280.
The previous prime is 11101211120053. The next prime is 11101211120119. The reversal of 11101211120101 is 10102111210111.
It can be written as a sum of positive squares in only one way, i.e., 10133870023876 + 967341096225 = 3183374^2 + 983535^2 .
It is not a de Polignac number, because 11101211120101 - 215 = 11101211087333 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 (11101211129101) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 15375638310 + ... + 15375639031.
It is an arithmetic number, because the mean of its divisors is an integer number (1952706111217).
Almost surely, 211101211120101 is an apocalyptic number.
It is an amenable number.
11101211120101 is a deficient number, since it is larger than the sum of its proper divisors (615025547201).
11101211120101 is an equidigital number, since it uses as much as digits as its factorization.
11101211120101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30751277379 (or 30751277360 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11101211120101 its reverse (10102111210111), we get a palindrome (21203322330212).
The spelling of 11101211120101 in words is "eleven trillion, one hundred one billion, two hundred eleven million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •