Base | Representation |
---|---|
bin | 1010000000111011100010… |
… | …1110010100110001011101 |
3 | 1102222122120111212220221112 |
4 | 2200032320232110301131 |
5 | 2420401213141043401 |
6 | 35230232450111405 |
7 | 2214345221350553 |
oct | 240167056246135 |
9 | 42878514786845 |
10 | 11011100331101 |
11 | 3565866094a72 |
12 | 129a03727b565 |
13 | 61b45b079b00 |
14 | 2a0d238c1bd3 |
15 | 141655e663bb |
hex | a03b8b94c5d |
11011100331101 has 12 divisors (see below), whose sum is σ = 12086594865108. Its totient is φ = 10024858456704.
The previous prime is 11011100331083. The next prime is 11011100331109. The reversal of 11011100331101 is 10113300111011.
It can be written as a sum of positive squares in 6 ways, for example, as 200820496900 + 10810279834201 = 448130^2 + 3287899^2 .
It is not a de Polignac number, because 11011100331101 - 210 = 11011100330077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011100331109) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 446250950 + ... + 446275623.
It is an arithmetic number, because the mean of its divisors is an integer number (1007216238759).
Almost surely, 211011100331101 is an apocalyptic number.
It is an amenable number.
11011100331101 is a deficient number, since it is larger than the sum of its proper divisors (1075494534007).
11011100331101 is an equidigital number, since it uses as much as digits as its factorization.
11011100331101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 892526672 (or 892526659 counting only the distinct ones).
The product of its (nonzero) digits is 9, while the sum is 14.
Adding to 11011100331101 its reverse (10113300111011), we get a palindrome (21124400442112).
The spelling of 11011100331101 in words is "eleven trillion, eleven billion, one hundred million, three hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •