Base | Representation |
---|---|
bin | 10011001000011001… |
… | …111001011001110111 |
3 | 1222000121120212011200 |
4 | 103020121321121313 |
5 | 314032234213421 |
6 | 13234212303543 |
7 | 1325023656420 |
oct | 231031713167 |
9 | 58017525150 |
10 | 20542101111 |
11 | 8791531674 |
12 | 3b93611bb3 |
13 | 1c24ab0a1c |
14 | dcc2ba647 |
15 | 80364d726 |
hex | 4c8679677 |
20542101111 has 12 divisors (see below), whose sum is σ = 33910770192. Its totient is φ = 11738343456.
The previous prime is 20542101109. The next prime is 20542101133. The reversal of 20542101111 is 11110124502.
20542101111 is a `hidden beast` number, since 2 + 0 + 542 + 10 + 1 + 111 = 666.
It is not a de Polignac number, because 20542101111 - 21 = 20542101109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20542101211) 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 11 ways as a sum of consecutive naturals, for example, 163032486 + ... + 163032611.
It is an arithmetic number, because the mean of its divisors is an integer number (2825897516).
Almost surely, 220542101111 is an apocalyptic number.
20542101111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20542101111 is a deficient number, since it is larger than the sum of its proper divisors (13368669081).
20542101111 is a wasteful number, since it uses less digits than its factorization.
20542101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326065110 (or 326065107 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 18.
Adding to 20542101111 its reverse (11110124502), we get a palindrome (31652225613).
The spelling of 20542101111 in words is "twenty billion, five hundred forty-two million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •