Base | Representation |
---|---|
bin | 1010000110101011111110… |
… | …0111000000011011101110 |
3 | 1110100002212000020210101000 |
4 | 2201222333213000123232 |
5 | 2424011240011213402 |
6 | 35343510311301130 |
7 | 2224446105464460 |
oct | 241527747003356 |
9 | 43302760223330 |
10 | 11110000101102 |
11 | 35a37a7468a81 |
12 | 12b523867a7a6 |
13 | 62788c957c86 |
14 | 2a5a26784130 |
15 | 143ee37c1c1c |
hex | a1abf9c06ee |
11110000101102 has 64 divisors (see below), whose sum is σ = 28904065344000. Its totient is φ = 3096864135360.
The previous prime is 11110000101089. The next prime is 11110000101131. The reversal of 11110000101102 is 20110100001111.
It is a super-2 number, since 2×111100001011022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 358417852 + ... + 358448847.
It is an arithmetic number, because the mean of its divisors is an integer number (451626021000).
Almost surely, 211110000101102 is an apocalyptic number.
11110000101102 is an abundant number, since it is smaller than the sum of its proper divisors (17794065242898).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11110000101102 is a wasteful number, since it uses less digits than its factorization.
11110000101102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 716866758 (or 716866752 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11110000101102 its reverse (20110100001111), we get a palindrome (31220100102213).
Subtracting 11110000101102 from its reverse (20110100001111), we obtain a palindrome (9000099900009).
The spelling of 11110000101102 in words is "eleven trillion, one hundred ten billion, one hundred one thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •