Base | Representation |
---|---|
bin | 1010000110000110110000… |
… | …1101101110010111111011 |
3 | 1110022011001212001101220001 |
4 | 2201201230031232113323 |
5 | 2423330310310430021 |
6 | 35335135155013431 |
7 | 2223643423001311 |
oct | 241415415562773 |
9 | 43264055041801 |
10 | 11100011030011 |
11 | 359a540939022 |
12 | 12b330b29a277 |
13 | 62695a2c6117 |
14 | 2a5359c680b1 |
15 | 143b0b872091 |
hex | a186c36e5fb |
11100011030011 has 2 divisors, whose sum is σ = 11100011030012. Its totient is φ = 11100011030010.
The previous prime is 11100011029999. The next prime is 11100011030023. The reversal of 11100011030011 is 11003011000111.
It is a balanced prime because it is at equal distance from previous prime (11100011029999) and next prime (11100011030023).
It is a cyclic number.
It is not a de Polignac number, because 11100011030011 - 27 = 11100011029883 is a prime.
It is a super-2 number, since 2×111000110300112 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11100011030011.
It is not a weakly prime, because it can be changed into another prime (11100011090011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550005515005 + 5550005515006.
It is an arithmetic number, because the mean of its divisors is an integer number (5550005515006).
Almost surely, 211100011030011 is an apocalyptic number.
11100011030011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100011030011 is an equidigital number, since it uses as much as digits as its factorization.
11100011030011 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 11100011030011 its reverse (11003011000111), we get a palindrome (22103022030122).
The spelling of 11100011030011 in words is "eleven trillion, one hundred billion, eleven million, thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •