Base | Representation |
---|---|
bin | 1010000000110111011110… |
… | …1111000111110010010011 |
3 | 1102222112202112021102200100 |
4 | 2200031313233013302103 |
5 | 2420342000031133021 |
6 | 35225532341023443 |
7 | 2214306212023131 |
oct | 240156757076223 |
9 | 42875675242610 |
10 | 11010010021011 |
11 | 3565356698951 |
12 | 12999920b4b83 |
13 | 61b31620c801 |
14 | 2a0c5cb86751 |
15 | 1415e0396626 |
hex | a0377bc7c93 |
11010010021011 has 24 divisors (see below), whose sum is σ = 16419076337664. Its totient is φ = 7102056512880.
The previous prime is 11010010021009. The next prime is 11010010021037. The reversal of 11010010021011 is 11012001001011.
It is not a de Polignac number, because 11010010021011 - 21 = 11010010021009 is a prime.
It is a super-2 number, since 2×110100100210112 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 11010010020984 and 11010010021002.
It is not an unprimeable number, because it can be changed into a prime (11010010020011) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1575861 + ... + 4950086.
It is an arithmetic number, because the mean of its divisors is an integer number (684128180736).
Almost surely, 211010010021011 is an apocalyptic number.
11010010021011 is a deficient number, since it is larger than the sum of its proper divisors (5409066316653).
11010010021011 is a wasteful number, since it uses less digits than its factorization.
11010010021011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6532031 (or 6532028 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11010010021011 its reverse (11012001001011), we get a palindrome (22022011022022).
The spelling of 11010010021011 in words is "eleven trillion, ten billion, ten million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •