Base | Representation |
---|---|
bin | 1010000110110000000111… |
… | …0101001000011011010000 |
3 | 1110100012201102210101111111 |
4 | 2201230001311020123100 |
5 | 2424021023420200422 |
6 | 35344212440023104 |
7 | 2224515456020602 |
oct | 241540165103320 |
9 | 43305642711444 |
10 | 11111111100112 |
11 | 35a4217605a81 |
12 | 12b54a8761a94 |
13 | 627a08b8a13a |
14 | 2a5ad0147172 |
15 | 14405b0cba77 |
hex | a1b01d486d0 |
11111111100112 has 10 divisors (see below), whose sum is σ = 21527777756498. Its totient is φ = 5555555550048.
The previous prime is 11111111100071. The next prime is 11111111100163. The reversal of 11111111100112 is 21100111111111.
It can be written as a sum of positive squares in only one way, i.e., 10963489165456 + 147621934656 = 3311116^2 + 384216^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11111111100092 and 11111111100101.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 347222221863 + ... + 347222221894.
Almost surely, 211111111100112 is an apocalyptic number.
It is an amenable number.
11111111100112 is a deficient number, since it is larger than the sum of its proper divisors (10416666656386).
11111111100112 is an equidigital number, since it uses as much as digits as its factorization.
11111111100112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 694444443765 (or 694444443759 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 11111111100112 its reverse (21100111111111), we get a palindrome (32211222211223).
The spelling of 11111111100112 in words is "eleven trillion, one hundred eleven billion, one hundred eleven million, one hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •