Base | Representation |
---|---|
bin | 1001010100101001000000… |
… | …11011111100111100100001 |
3 | 2200120211011201211001001122 |
4 | 10222110200123330330201 |
5 | 10141334331303232431 |
6 | 111333433033542025 |
7 | 4214051411142425 |
oct | 452244033747441 |
9 | 80524151731048 |
10 | 20500423102241 |
11 | 65941a943a505 |
12 | 2371152274915 |
13 | b59248ca1564 |
14 | 50c32373ab85 |
15 | 2583e2be2a7b |
hex | 12a5206fcf21 |
20500423102241 has 2 divisors, whose sum is σ = 20500423102242. Its totient is φ = 20500423102240.
The previous prime is 20500423102231. The next prime is 20500423102249. The reversal of 20500423102241 is 14220132400502.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12030693423841 + 8469729678400 = 3468529^2 + 2910280^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20500423102241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20500423102241.
It is not a weakly prime, because it can be changed into another prime (20500423102249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10250211551120 + 10250211551121.
It is an arithmetic number, because the mean of its divisors is an integer number (10250211551121).
Almost surely, 220500423102241 is an apocalyptic number.
It is an amenable number.
20500423102241 is a deficient number, since it is larger than the sum of its proper divisors (1).
20500423102241 is an equidigital number, since it uses as much as digits as its factorization.
20500423102241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3840, while the sum is 26.
Adding to 20500423102241 its reverse (14220132400502), we get a palindrome (34720555502743).
The spelling of 20500423102241 in words is "twenty trillion, five hundred billion, four hundred twenty-three million, one hundred two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •