Base | Representation |
---|---|
bin | 1001010000011000100001… |
… | …11100100000110000011011 |
3 | 2200001211120121122121122212 |
4 | 10220030100330200300123 |
5 | 10131440231341022021 |
6 | 111142321001305335 |
7 | 4200352265022521 |
oct | 450142074406033 |
9 | 80054517577585 |
10 | 20354134314011 |
11 | 653815a209723 |
12 | 234892649524b |
13 | b4850456ccc4 |
14 | 505206c08311 |
15 | 2546ced4185b |
hex | 128310f20c1b |
20354134314011 has 2 divisors, whose sum is σ = 20354134314012. Its totient is φ = 20354134314010.
The previous prime is 20354134313983. The next prime is 20354134314043. The reversal of 20354134314011 is 11041343145302.
It is an a-pointer prime, because the next prime (20354134314043) can be obtained adding 20354134314011 to its sum of digits (32).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20354134314011 is a prime.
It is not a weakly prime, because it can be changed into another prime (20354134314061) 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, 10177067157005 + 10177067157006.
It is an arithmetic number, because the mean of its divisors is an integer number (10177067157006).
Almost surely, 220354134314011 is an apocalyptic number.
20354134314011 is a deficient number, since it is larger than the sum of its proper divisors (1).
20354134314011 is an equidigital number, since it uses as much as digits as its factorization.
20354134314011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 32.
Adding to 20354134314011 its reverse (11041343145302), we get a palindrome (31395477459313).
The spelling of 20354134314011 in words is "twenty trillion, three hundred fifty-four billion, one hundred thirty-four million, three hundred fourteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •