Base | Representation |
---|---|
bin | 110001000101011111… |
… | …1001000100100110111 |
3 | 101002002021102200210000 |
4 | 1202022333020210313 |
5 | 3211340210133421 |
6 | 120231500002343 |
7 | 10421116616154 |
oct | 1421277104467 |
9 | 332067380700 |
10 | 105411021111 |
11 | 40782856380 |
12 | 18519b303b3 |
13 | 9c2b86b196 |
14 | 515d95522b |
15 | 2b1e2d0226 |
hex | 188afc8937 |
105411021111 has 40 divisors (see below), whose sum is σ = 172099235088. Its totient is φ = 63767088000.
The previous prime is 105411021097. The next prime is 105411021119. The reversal of 105411021111 is 111120114501.
105411021111 is a `hidden beast` number, since 1 + 0 + 541 + 10 + 2 + 1 + 111 = 666.
It is not a de Polignac number, because 105411021111 - 210 = 105411020087 is a prime.
It is a super-2 number, since 2×1054110211112 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105411021119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 372691 + ... + 591371.
Almost surely, 2105411021111 is an apocalyptic number.
105411021111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
105411021111 is a deficient number, since it is larger than the sum of its proper divisors (66688213977).
105411021111 is a wasteful number, since it uses less digits than its factorization.
105411021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219245 (or 219236 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 18.
Adding to 105411021111 its reverse (111120114501), we get a palindrome (216531135612).
The spelling of 105411021111 in words is "one hundred five billion, four hundred eleven million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •