Base | Representation |
---|---|
bin | 10010101110101010… |
… | …110111001110011111 |
3 | 1220220112011011200022 |
4 | 102232222313032133 |
5 | 312141221403043 |
6 | 13123310222355 |
7 | 1311232035563 |
oct | 225652671637 |
9 | 56815134608 |
10 | 20110341023 |
11 | 858a843953 |
12 | 3a92ab49bb |
13 | 1b864cc296 |
14 | d8ac096a3 |
15 | 7ca7b4868 |
hex | 4aeab739f |
20110341023 has 2 divisors, whose sum is σ = 20110341024. Its totient is φ = 20110341022.
The previous prime is 20110340963. The next prime is 20110341037. The reversal of 20110341023 is 32014301102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20110341023 - 26 = 20110340959 is a prime.
It is a super-2 number, since 2×201103410232 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20110340992 and 20110341010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20110340023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055170511 + 10055170512.
It is an arithmetic number, because the mean of its divisors is an integer number (10055170512).
Almost surely, 220110341023 is an apocalyptic number.
20110341023 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110341023 is an equidigital number, since it uses as much as digits as its factorization.
20110341023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 20110341023 its reverse (32014301102), we get a palindrome (52124642125).
The spelling of 20110341023 in words is "twenty billion, one hundred ten million, three hundred forty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •