Base | Representation |
---|---|
bin | 10010101000110000… |
… | …010010101101011111 |
3 | 1220122121102020222202 |
4 | 102220300102231133 |
5 | 311440320213043 |
6 | 13105403202115 |
7 | 1305615360254 |
oct | 225060225537 |
9 | 56577366882 |
10 | 20011101023 |
11 | 8539821421 |
12 | 3a6581633b |
13 | 1b6ba936a4 |
14 | d7b97542b |
15 | 7c1c101b8 |
hex | 4a8c12b5f |
20011101023 has 2 divisors, whose sum is σ = 20011101024. Its totient is φ = 20011101022.
The previous prime is 20011100999. The next prime is 20011101041. The reversal of 20011101023 is 32010111002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20011101023 - 212 = 20011096927 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20011100995 and 20011101013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20011101323) 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, 10005550511 + 10005550512.
It is an arithmetic number, because the mean of its divisors is an integer number (10005550512).
Almost surely, 220011101023 is an apocalyptic number.
20011101023 is a deficient number, since it is larger than the sum of its proper divisors (1).
20011101023 is an equidigital number, since it uses as much as digits as its factorization.
20011101023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 20011101023 its reverse (32010111002), we get a palindrome (52021212025).
The spelling of 20011101023 in words is "twenty billion, eleven million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •