Base | Representation |
---|---|
bin | 1001001001011101001011… |
… | …01101011101010011110101 |
3 | 2122020002012102200110202222 |
4 | 10210232211231131103311 |
5 | 10114040244133114331 |
6 | 110441114141212125 |
7 | 4144225002540653 |
oct | 444564555352365 |
9 | 78202172613688 |
10 | 20116112004341 |
11 | 6456216889501 |
12 | 230a779261045 |
13 | b2bc30b34152 |
14 | 4d78a7087dd3 |
15 | 24d3ed83cb7b |
hex | 124ba5b5d4f5 |
20116112004341 has 2 divisors, whose sum is σ = 20116112004342. Its totient is φ = 20116112004340.
The previous prime is 20116112004271. The next prime is 20116112004409. The reversal of 20116112004341 is 14340021161102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19182078670225 + 934033334116 = 4379735^2 + 966454^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20116112004341 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20116112004341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20116112004041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10058056002170 + 10058056002171.
It is an arithmetic number, because the mean of its divisors is an integer number (10058056002171).
Almost surely, 220116112004341 is an apocalyptic number.
It is an amenable number.
20116112004341 is a deficient number, since it is larger than the sum of its proper divisors (1).
20116112004341 is an equidigital number, since it uses as much as digits as its factorization.
20116112004341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 20116112004341 its reverse (14340021161102), we get a palindrome (34456133165443).
The spelling of 20116112004341 in words is "twenty trillion, one hundred sixteen billion, one hundred twelve million, four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •