Base | Representation |
---|---|
bin | 10100100001101100… |
… | …10110010110100111 |
3 | 1001110000021010200001 |
4 | 22100312112112213 |
5 | 140032121213111 |
6 | 5021303002131 |
7 | 540042212302 |
oct | 122066262647 |
9 | 31400233601 |
10 | 11020101031 |
11 | 4745618015 |
12 | 2176739347 |
13 | 1068144a54 |
14 | 767823b39 |
15 | 4477101c1 |
hex | 290d965a7 |
11020101031 has 2 divisors, whose sum is σ = 11020101032. Its totient is φ = 11020101030.
The previous prime is 11020100989. The next prime is 11020101047. The reversal of 11020101031 is 13010102011.
11020101031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11020101031 - 223 = 11011712423 is a prime.
It is a super-2 number, since 2×110201010312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11020100999 and 11020101017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11020101091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510050515 + 5510050516.
It is an arithmetic number, because the mean of its divisors is an integer number (5510050516).
Almost surely, 211020101031 is an apocalyptic number.
11020101031 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020101031 is an equidigital number, since it uses as much as digits as its factorization.
11020101031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 11020101031 its reverse (13010102011), we get a palindrome (24030203042).
The spelling of 11020101031 in words is "eleven billion, twenty million, one hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •