Base | Representation |
---|---|
bin | 1010000110000111011101… |
… | …1111011001001001010100 |
3 | 1110022011120001000210110101 |
4 | 2201201313133121021110 |
5 | 2423331202223223103 |
6 | 35335210033503444 |
7 | 2223651211005415 |
oct | 241416737311124 |
9 | 43264501023411 |
10 | 11100200211028 |
11 | 359a628701575 |
12 | 12b3362711b84 |
13 | 62698a562b56 |
14 | 2a537703180c |
15 | 143b1d290a1d |
hex | a18777d9254 |
11100200211028 has 6 divisors (see below), whose sum is σ = 19425350369306. Its totient is φ = 5550100105512.
The previous prime is 11100200210989. The next prime is 11100200211029. The reversal of 11100200211028 is 82011200200111.
11100200211028 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 8174006796484 + 2926193414544 = 2859022^2 + 1710612^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11100200210996 and 11100200211014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100200211029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1387525026375 + ... + 1387525026382.
Almost surely, 211100200211028 is an apocalyptic number.
It is an amenable number.
11100200211028 is a deficient number, since it is larger than the sum of its proper divisors (8325150158278).
11100200211028 is a wasteful number, since it uses less digits than its factorization.
11100200211028 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2775050052761 (or 2775050052759 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 11100200211028 its reverse (82011200200111), we get a palindrome (93111400411139).
The spelling of 11100200211028 in words is "eleven trillion, one hundred billion, two hundred million, two hundred eleven thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •