Base | Representation |
---|---|
bin | 1010000001011100101111… |
… | …0101110101100010011011 |
3 | 1110000111120111212220111001 |
4 | 2200113023311311202123 |
5 | 2421022440304031021 |
6 | 35234305000445431 |
7 | 2215112100662134 |
oct | 240271365654233 |
9 | 43014514786431 |
10 | 11020011002011 |
11 | 3569618a12a00 |
12 | 129b903479877 |
13 | 61c24b18164b |
14 | 2a152b0c2c8b |
15 | 1419c839a091 |
hex | a05cbd7589b |
11020011002011 has 12 divisors (see below), whose sum is σ = 12341450033136. Its totient is φ = 9829169327120.
The previous prime is 11020011001999. The next prime is 11020011002017.
11020011002011 is nontrivially palindromic in base 10.
It is a de Polignac number, because none of the positive numbers 2k-11020011002011 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11020011002017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 859186711 + ... + 859199536.
It is an arithmetic number, because the mean of its divisors is an integer number (1028454169428).
Almost surely, 211020011002011 is an apocalyptic number.
11020011002011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11020011002011 is a deficient number, since it is larger than the sum of its proper divisors (1321439031125).
11020011002011 is a wasteful number, since it uses less digits than its factorization.
11020011002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1718386322 (or 1718386311 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
It can be divided in two parts, 1102001 and 1002011, that multiplied together give a palindrome (1104217124011).
The spelling of 11020011002011 in words is "eleven trillion, twenty billion, eleven million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •