Base | Representation |
---|---|
bin | 1010000110000111011110… |
… | …0111000001011100011110 |
3 | 1110022011120011210102001012 |
4 | 2201201313213001130132 |
5 | 2423331203231223402 |
6 | 35335210144415222 |
7 | 2223651234005504 |
oct | 241416747013436 |
9 | 43264504712035 |
10 | 11100202211102 |
11 | 359a629848224 |
12 | 12b3363317512 |
13 | 62698aab3324 |
14 | 2a53773d2674 |
15 | 143b1d538452 |
hex | a18779c171e |
11100202211102 has 8 divisors (see below), whose sum is σ = 16650381307536. Its totient is φ = 5550075108592.
The previous prime is 11100202211099. The next prime is 11100202211107. The reversal of 11100202211102 is 20111220200111.
11100202211102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100202211107) 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, 12460298 + ... + 13321389.
It is an arithmetic number, because the mean of its divisors is an integer number (2081297663442).
Almost surely, 211100202211102 is an apocalyptic number.
11100202211102 is a deficient number, since it is larger than the sum of its proper divisors (5550179096434).
11100202211102 is a wasteful number, since it uses less digits than its factorization.
11100202211102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25996962.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11100202211102 its reverse (20111220200111), we get a palindrome (31211422411213).
It can be divided in two parts, 11100 and 202211102, that added together give a palindrome (202222202).
The spelling of 11100202211102 in words is "eleven trillion, one hundred billion, two hundred two million, two hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.185 sec. • engine limits •