Base | Representation |
---|---|
bin | 10011000110010010… |
… | …001010000000001001 |
3 | 1221221010122000122122 |
4 | 103012102022000021 |
5 | 313444132030023 |
6 | 13230501501025 |
7 | 1324112344226 |
oct | 230622120011 |
9 | 57833560578 |
10 | 20506517513 |
11 | 8773438139 |
12 | 3b83711775 |
13 | 1c1a602441 |
14 | dc769694d |
15 | 8004702c8 |
hex | 4c648a009 |
20506517513 has 4 divisors (see below), whose sum is σ = 20511843588. Its totient is φ = 20501191440.
The previous prime is 20506517503. The next prime is 20506517519. The reversal of 20506517513 is 31571560502.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31571560502 = 2 ⋅15785780251.
It can be written as a sum of positive squares in 2 ways, for example, as 13564795024 + 6941722489 = 116468^2 + 83317^2 .
It is a cyclic number.
It is not a de Polignac number, because 20506517513 - 210 = 20506516489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20506517519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2657258 + ... + 2664963.
It is an arithmetic number, because the mean of its divisors is an integer number (5127960897).
Almost surely, 220506517513 is an apocalyptic number.
It is an amenable number.
20506517513 is a deficient number, since it is larger than the sum of its proper divisors (5326075).
20506517513 is an equidigital number, since it uses as much as digits as its factorization.
20506517513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5326074.
The product of its (nonzero) digits is 31500, while the sum is 35.
The spelling of 20506517513 in words is "twenty billion, five hundred six million, five hundred seventeen thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •