Base | Representation |
---|---|
bin | 100111010100… |
… | …0011110010101 |
3 | 1102210020201221 |
4 | 1032220132111 |
5 | 20234104023 |
6 | 2013450341 |
7 | 340131151 |
oct | 116503625 |
9 | 42706657 |
10 | 20613013 |
11 | 106a9953 |
12 | 6aa09b1 |
13 | 4369465 |
14 | 2a48061 |
15 | 1c2285d |
hex | 13a8795 |
20613013 has 4 divisors (see below), whose sum is σ = 20622508. Its totient is φ = 20603520.
The previous prime is 20612957. The next prime is 20613029. The reversal of 20613013 is 31031602.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 18173169 + 2439844 = 4263^2 + 1562^2 .
It is a cyclic number.
It is not a de Polignac number, because 20613013 - 217 = 20481941 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20613053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 295 + ... + 6427.
It is an arithmetic number, because the mean of its divisors is an integer number (5155627).
Almost surely, 220613013 is an apocalyptic number.
It is an amenable number.
20613013 is a deficient number, since it is larger than the sum of its proper divisors (9495).
20613013 is an equidigital number, since it uses as much as digits as its factorization.
20613013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9494.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 20613013 is about 4540.1556140732. The cubic root of 20613013 is about 274.1871889410.
Adding to 20613013 its reverse (31031602), we get a palindrome (51644615).
The spelling of 20613013 in words is "twenty million, six hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •