Base | Representation |
---|---|
bin | 1001010101110000011001… |
… | …10010000101000000010011 |
3 | 2200201111002122222210201222 |
4 | 10222320030302011000103 |
5 | 10143001324001020023 |
6 | 111403212014515255 |
7 | 4216606216013216 |
oct | 452701462050023 |
9 | 80644078883658 |
10 | 20538748063763 |
11 | 65a9485924326 |
12 | 2378669205b2b |
13 | b5ca46007097 |
14 | 51011b67d77d |
15 | 2593d7606cc8 |
hex | 12ae0cc85013 |
20538748063763 has 4 divisors (see below), whose sum is σ = 20540996923008. Its totient is φ = 20536499204520.
The previous prime is 20538748063739. The next prime is 20538748063789. The reversal of 20538748063763 is 36736084783502.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20538748063763 - 210 = 20538748062739 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20538748063696 and 20538748063705.
It is not an unprimeable number, because it can be changed into a prime (20538748063963) 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 in 3 ways as a sum of consecutive naturals, for example, 1124415923 + ... + 1124434188.
It is an arithmetic number, because the mean of its divisors is an integer number (5135249230752).
Almost surely, 220538748063763 is an apocalyptic number.
20538748063763 is a deficient number, since it is larger than the sum of its proper divisors (2248859245).
20538748063763 is an equidigital number, since it uses as much as digits as its factorization.
20538748063763 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2248859244.
The product of its (nonzero) digits is 121927680, while the sum is 62.
The spelling of 20538748063763 in words is "twenty trillion, five hundred thirty-eight billion, seven hundred forty-eight million, sixty-three thousand, seven hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •