Base | Representation |
---|---|
bin | 1010000011001100110101… |
… | …0110000100101110010001 |
3 | 1110010101020112112020101221 |
4 | 2200303031112010232101 |
5 | 2422021101324013410 |
6 | 35300202445525041 |
7 | 2220225542521045 |
oct | 240631526045621 |
9 | 43111215466357 |
10 | 11050101001105 |
11 | 3580359a37651 |
12 | 12a5700573781 |
13 | 62203509813a |
14 | 2a2b83478025 |
15 | 142689d504da |
hex | a0ccd584b91 |
11050101001105 has 16 divisors (see below), whose sum is σ = 13448883533904. Its totient is φ = 8714990540800.
The previous prime is 11050101001099. The next prime is 11050101001129. The reversal of 11050101001105 is 50110010105011.
It can be written as a sum of positive squares in 8 ways, for example, as 7027636561 + 11043073364544 = 83831^2 + 3323112^2 .
It is not a de Polignac number, because 11050101001105 - 27 = 11050101000977 is a prime.
It is a super-2 number, since 2×110501010011052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 46838104 + ... + 47073433.
It is an arithmetic number, because the mean of its divisors is an integer number (840555220869).
Almost surely, 211050101001105 is an apocalyptic number.
It is an amenable number.
11050101001105 is a deficient number, since it is larger than the sum of its proper divisors (2398782532799).
11050101001105 is a wasteful number, since it uses less digits than its factorization.
11050101001105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93911876.
The product of its (nonzero) digits is 25, while the sum is 16.
Adding to 11050101001105 its reverse (50110010105011), we get a palindrome (61160111106116).
The spelling of 11050101001105 in words is "eleven trillion, fifty billion, one hundred one million, one thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •