Base | Representation |
---|---|
bin | 1001010101011011110000… |
… | …00101011000100110110101 |
3 | 2200200102111011012210002120 |
4 | 10222231320011120212311 |
5 | 10142311123311310023 |
6 | 111354140043430153 |
7 | 4216034430546441 |
oct | 452557005304665 |
9 | 80612434183076 |
10 | 20527663385013 |
11 | 65a480790a0a4 |
12 | 2376494b25359 |
13 | b5b99a6a1885 |
14 | 50d789449821 |
15 | 258e893dc8e3 |
hex | 12ab781589b5 |
20527663385013 has 4 divisors (see below), whose sum is σ = 27370217846688. Its totient is φ = 13685108923340.
The previous prime is 20527663385003. The next prime is 20527663385051. The reversal of 20527663385013 is 31058336672502.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20527663385013 - 213 = 20527663376821 is a prime.
It is a super-3 number, since 3×205276633850133 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20527663385003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3421277230833 + ... + 3421277230838.
It is an arithmetic number, because the mean of its divisors is an integer number (6842554461672).
Almost surely, 220527663385013 is an apocalyptic number.
It is an amenable number.
20527663385013 is a deficient number, since it is larger than the sum of its proper divisors (6842554461675).
20527663385013 is an equidigital number, since it uses as much as digits as its factorization.
20527663385013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6842554461674.
The product of its (nonzero) digits is 5443200, while the sum is 51.
The spelling of 20527663385013 in words is "twenty trillion, five hundred twenty-seven billion, six hundred sixty-three million, three hundred eighty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •