Base | Representation |
---|---|
bin | 1010000110000111001011… |
… | …0010000100011111110111 |
3 | 1110022011100112101200122220 |
4 | 2201201302302010133313 |
5 | 2423331022013033421 |
6 | 35335154132453423 |
7 | 2223646231420206 |
oct | 241416262043767 |
9 | 43264315350586 |
10 | 11100121221111 |
11 | 359a59806024a |
12 | 12b334017a273 |
13 | 626977097460 |
14 | 2a536a74d23d |
15 | 143b1638b3c6 |
hex | a1872c847f7 |
11100121221111 has 32 divisors (see below), whose sum is σ = 16057609774080. Its totient is φ = 6779965659264.
The previous prime is 11100121221073. The next prime is 11100121221127. The reversal of 11100121221111 is 11112212100111.
11100121221111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11100121221111 - 217 = 11100121090039 is a prime.
It is a super-2 number, since 2×111001212211112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100121221191) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3658930 + ... + 5965568.
It is an arithmetic number, because the mean of its divisors is an integer number (501800305440).
Almost surely, 211100121221111 is an apocalyptic number.
11100121221111 is a deficient number, since it is larger than the sum of its proper divisors (4957488552969).
11100121221111 is a wasteful number, since it uses less digits than its factorization.
11100121221111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2307575.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 11100121221111 its reverse (11112212100111), we get a palindrome (22212333321222).
The spelling of 11100121221111 in words is "eleven trillion, one hundred billion, one hundred twenty-one million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •