Base | Representation |
---|---|
bin | 1001000110011101110010… |
… | …11011000111110111100101 |
3 | 2121212020222201022000121102 |
4 | 10203032321123013313211 |
5 | 10110344332030332031 |
6 | 110322002352525445 |
7 | 4133626543103255 |
oct | 443167133076745 |
9 | 77766881260542 |
10 | 20013363527141 |
11 | 641668aa66846 |
12 | 22b2882b50885 |
13 | b22337a96a4a |
14 | 4d291adb5965 |
15 | 24a8d81947cb |
hex | 1233b96c7de5 |
20013363527141 has 2 divisors, whose sum is σ = 20013363527142. Its totient is φ = 20013363527140.
The previous prime is 20013363527119. The next prime is 20013363527219. The reversal of 20013363527141 is 14172536331002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12076465964641 + 7936897562500 = 3475121^2 + 2817250^2 .
It is a cyclic number.
It is not a de Polignac number, because 20013363527141 - 26 = 20013363527077 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20013363527095 and 20013363527104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20013363547141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10006681763570 + 10006681763571.
It is an arithmetic number, because the mean of its divisors is an integer number (10006681763571).
Almost surely, 220013363527141 is an apocalyptic number.
It is an amenable number.
20013363527141 is a deficient number, since it is larger than the sum of its proper divisors (1).
20013363527141 is an equidigital number, since it uses as much as digits as its factorization.
20013363527141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 90720, while the sum is 38.
Adding to 20013363527141 its reverse (14172536331002), we get a palindrome (34185899858143).
The spelling of 20013363527141 in words is "twenty trillion, thirteen billion, three hundred sixty-three million, five hundred twenty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •