Base | Representation |
---|---|
bin | 1010000110011011001110… |
… | …0000100101110010010001 |
3 | 1110022200020112111221101222 |
4 | 2201212303200211302101 |
5 | 2423423032021001301 |
6 | 35341444112134425 |
7 | 2224226460354221 |
oct | 241466340456221 |
9 | 43280215457358 |
10 | 11105502125201 |
11 | 35a18a9480120 |
12 | 12b43a2237415 |
13 | 627323b0c883 |
14 | 2a571b244081 |
15 | 143d2d98331b |
hex | a19b3825c91 |
11105502125201 has 16 divisors (see below), whose sum is σ = 12658851210240. Its totient is φ = 9643960954320.
The previous prime is 11105502125183. The next prime is 11105502125231. The reversal of 11105502125201 is 10252120550111.
It is not a de Polignac number, because 11105502125201 - 210 = 11105502124177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11105502125231) 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 15 ways as a sum of consecutive naturals, for example, 29351231 + ... + 29727188.
It is an arithmetic number, because the mean of its divisors is an integer number (791178200640).
Almost surely, 211105502125201 is an apocalyptic number.
11105502125201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11105502125201 is a deficient number, since it is larger than the sum of its proper divisors (1553349085039).
11105502125201 is a wasteful number, since it uses less digits than its factorization.
11105502125201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59079196.
The product of its (nonzero) digits is 1000, while the sum is 26.
Adding to 11105502125201 its reverse (10252120550111), we get a palindrome (21357622675312).
The spelling of 11105502125201 in words is "eleven trillion, one hundred five billion, five hundred two million, one hundred twenty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •