Base | Representation |
---|---|
bin | 1001001001010010110011… |
… | …10010010011110000001001 |
3 | 2122012112211100001221111021 |
4 | 10210221121302103300021 |
5 | 10113442343032141301 |
6 | 110434353411232441 |
7 | 4143640003041001 |
oct | 444513162236011 |
9 | 78175740057437 |
10 | 20110543240201 |
11 | 6453919418597 |
12 | 23096842a8721 |
13 | b2b5541c533b |
14 | 4d74d9651001 |
15 | 24d1c49d88a1 |
hex | 124a59c93c09 |
20110543240201 has 2 divisors, whose sum is σ = 20110543240202. Its totient is φ = 20110543240200.
The previous prime is 20110543240147. The next prime is 20110543240213. The reversal of 20110543240201 is 10204234501102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13395453600400 + 6715089639801 = 3659980^2 + 2591349^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20110543240201 is a prime.
It is not a weakly prime, because it can be changed into another prime (20110543240231) 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 as a sum of consecutive naturals, namely, 10055271620100 + 10055271620101.
It is an arithmetic number, because the mean of its divisors is an integer number (10055271620101).
Almost surely, 220110543240201 is an apocalyptic number.
It is an amenable number.
20110543240201 is a deficient number, since it is larger than the sum of its proper divisors (1).
20110543240201 is an equidigital number, since it uses as much as digits as its factorization.
20110543240201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 20110543240201 its reverse (10204234501102), we get a palindrome (30314777741303).
The spelling of 20110543240201 in words is "twenty trillion, one hundred ten billion, five hundred forty-three million, two hundred forty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.295 sec. • engine limits •