Base | Representation |
---|---|
bin | 10010110100001101… |
… | …100101101000111111 |
3 | 1221011000010111201121 |
4 | 102310031211220333 |
5 | 312334023030421 |
6 | 13140431251411 |
7 | 1313441321026 |
oct | 226415455077 |
9 | 57130114647 |
10 | 20203330111 |
11 | 8628286a38 |
12 | 3aba079b67 |
13 | 1b9c859903 |
14 | d992d38bd |
15 | 7d3a31d41 |
hex | 4b4365a3f |
20203330111 has 16 divisors (see below), whose sum is σ = 22355296704. Its totient is φ = 18160902144.
The previous prime is 20203330093. The next prime is 20203330129. The reversal of 20203330111 is 11103330202.
It is an interprime number because it is at equal distance from previous prime (20203330093) and next prime (20203330129).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20203330111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20203330711) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 224755 + ... + 301531.
It is an arithmetic number, because the mean of its divisors is an integer number (1397206044).
Almost surely, 220203330111 is an apocalyptic number.
20203330111 is a deficient number, since it is larger than the sum of its proper divisors (2151966593).
20203330111 is a wasteful number, since it uses less digits than its factorization.
20203330111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77490.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 20203330111 its reverse (11103330202), we get a palindrome (31306660313).
Subtracting from 20203330111 its reverse (11103330202), we obtain a palindrome (9099999909).
The spelling of 20203330111 in words is "twenty billion, two hundred three million, three hundred thirty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •