Base | Representation |
---|---|
bin | 10100100001101100… |
… | …10110100101111011 |
3 | 1001110000021012000100 |
4 | 22100312112211323 |
5 | 140032121231021 |
6 | 5021303010443 |
7 | 540042215202 |
oct | 122066264573 |
9 | 31400235010 |
10 | 11020102011 |
11 | 4745618826 |
12 | 2176739a23 |
13 | 1068145329 |
14 | 767824239 |
15 | 447710626 |
hex | 290d9697b |
11020102011 has 12 divisors (see below), whose sum is σ = 16755710920. Its totient is φ = 6960064320.
The previous prime is 11020102007. The next prime is 11020102013.
It is a happy number.
11020102011 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 11020102011 - 22 = 11020102007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11020101984 and 11020102002.
It is not an unprimeable number, because it can be changed into a prime (11020102013) 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, 32222350 + ... + 32222691.
Almost surely, 211020102011 is an apocalyptic number.
11020102011 is a deficient number, since it is larger than the sum of its proper divisors (5735608909).
11020102011 is a wasteful number, since it uses less digits than its factorization.
11020102011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64445066 (or 64445063 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
The spelling of 11020102011 in words is "eleven billion, twenty million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •