Base | Representation |
---|---|
bin | 1010000110101111110001… |
… | …1010000010010011111100 |
3 | 1110100012111002120200001002 |
4 | 2201223330122002103330 |
5 | 2424020332122023400 |
6 | 35344155425505432 |
7 | 2224513302435530 |
oct | 241537432022374 |
9 | 43305432520032 |
10 | 11111020111100 |
11 | 35a4180209648 |
12 | 12b54821a2278 |
13 | 6279c307cca0 |
14 | 2a5ac201dbc0 |
15 | 144053106ed5 |
hex | a1afc6824fc |
11111020111100 has 144 divisors (see below), whose sum is σ = 31420557580608. Its totient is φ = 3309604392960.
The previous prime is 11111020111099. The next prime is 11111020111111. The reversal of 11111020111100 is 111102011111.
It is a happy number.
11111020111100 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 35756807 + ... + 36066206.
It is an arithmetic number, because the mean of its divisors is an integer number (218198316532).
Almost surely, 211111020111100 is an apocalyptic number.
11111020111100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11111020111100 is an abundant number, since it is smaller than the sum of its proper divisors (20309537469508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11111020111100 is a wasteful number, since it uses less digits than its factorization.
11111020111100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 71823064 (or 71823057 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 11111020111100 its reverse (111102011111), we get a palindrome (11222122122211).
The spelling of 11111020111100 in words is "eleven trillion, one hundred eleven billion, twenty million, one hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •