Base | Representation |
---|---|
bin | 10011000110000011… |
… | …101001101011101001 |
3 | 1221220212110211202000 |
4 | 103012003221223221 |
5 | 313442143340423 |
6 | 13230244201213 |
7 | 1324035126426 |
oct | 230603515351 |
9 | 57825424660 |
10 | 20502715113 |
11 | 8771280361 |
12 | 3b82399209 |
13 | 1c198a07ba |
14 | dc6d86d4d |
15 | 7eee6d843 |
hex | 4c60e9ae9 |
20502715113 has 16 divisors (see below), whose sum is σ = 30404241600. Its totient is φ = 13655044800.
The previous prime is 20502715099. The next prime is 20502715151. The reversal of 20502715113 is 31151720502.
20502715113 is a `hidden beast` number, since 2 + 0 + 502 + 7 + 151 + 1 + 3 = 666.
It is not a de Polignac number, because 20502715113 - 212 = 20502711017 is a prime.
It is a super-3 number, since 3×205027151133 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (20502715213) 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 15 ways as a sum of consecutive naturals, for example, 345088 + ... + 400113.
It is an arithmetic number, because the mean of its divisors is an integer number (1900265100).
Almost surely, 220502715113 is an apocalyptic number.
It is an amenable number.
20502715113 is a deficient number, since it is larger than the sum of its proper divisors (9901526487).
20502715113 is a wasteful number, since it uses less digits than its factorization.
20502715113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 746229 (or 746223 counting only the distinct ones).
The product of its (nonzero) digits is 2100, while the sum is 27.
The spelling of 20502715113 in words is "twenty billion, five hundred two million, seven hundred fifteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •